Results 231 to 240 of about 39,214 (275)
Some of the next articles are maybe not open access.
2011
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
Integrating Automated and Interactive Theorem Proving
1998Automated and interactive theorem proving are the two main directions in the field of deduction. Most chapters of this book belong to either the one or the other, whether focusing on theory, on methods or on systems. This reflects the fact that, for a long time, research in computer-aided reasoning was divided into these two directions, driven forward ...
Ahrendt, Wolfgang +6 more
openaire +2 more sources
Automated theorem proving for ?ukasiewicz logics
Studia Logica, 1993The paper is concerned with decision procedures for the \(\aleph_ 0\)- valued Łukasiewicz logic \(L_{\aleph_ 0}\). Within the paper, the author presents an attempt to use linear programming techniques in theorem provers for the \(\aleph_ 0\)-valued Łukasiewicz logics.
openaire +1 more source
Automated Theorem Proving 1965–1970
1983In this article we give a critical history of automated theorem proving from 1965 through 1970. By evaluating the contributions of the period, we provide a guide to a study of the field during its development. In order to differentiate between that work which turned out to be significant and that which had lesser impact, we occasionally rely of ...
L. Wos, L. Henschen
openaire +1 more source
STRATEGY PARALLELISM IN AUTOMATED THEOREM PROVING
International Journal of Pattern Recognition and Artificial Intelligence, 1999Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successful on all problems. This motivates us to apply different strategies in parallel, in a competitive manner. In this paper, we discuss properties, problems, and perspectives of strategy parallelism in theorem proving.
ANDREAS WOLF, REINHOLD LETZ
openaire +1 more source
Parallel Automated Theorem Proving
1994Abstract This paper provides a comprehensive overview of parallel automated theorem proving, containing a description, analysis, and extensive references, for each approach. Implemented systems as well as sufficiently elaborated proposals are included, and grouped according to a new classification scheme, independent of the underlying calculus.
openaire +1 more source
Hilbert’s ∈-Terms in Automated Theorem Proving
1999∈-terms, introduced by David Hilbert [8], have the form ∈x.φ, where x is a variable and φ is a formula. Their syntactical structure is thus similar to that of a quantified formulae, but they are terms, denoting ‘an element for which φ holds, if there is any’.
Martin Giese, Wolfgang Ahrendt
openaire +1 more source
Automated theorem proving: the resolution method
ACM SIGSAM Bulletin, 1987The goal of this project is to learn the basic notions of predicate logic and of automated theorem proving. A small theorem prover written in LISP has been taken from [1] and can be used for this project. Knowledge of the programming language LISP is required only for the optional part of the project.
openaire +1 more source
Automating Theorem Proving with SMT
2013The power and automation offered by modern satisfiability-modulo-theories (SMT) solvers is changing the landscape for mechanized formal theorem proving. For instance, the SMT-based program verifier Dafny supports a number of proof features traditionally found only in interactive proof assistants, like inductive, co-inductive, and declarative proofs. To
openaire +1 more source
Automated theorem proving for special functions
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, 2014Automated theorem proving, in a nutshell, is the combination of symbolic logic with syntactic algorithms. A formal proof calculus is chosen with two criteria in mind: expressiveness and ease of automation. These desiderata pull in opposite directions: Boolean logic and linear arithmetic are decidable, so the answers to all questions can simply be ...
openaire +1 more source