Results 211 to 220 of about 1,423 (254)

Directed Automated Theorem Proving

2002
This paper analyzes the effect of heuristic search algorithms like A* and IDA* to accelerate proof-state based theorem provers. A functional implementation of possibly weighted A* is proposed that extends Dijkstra's single-source shortest-path algorithm. Efficient implementation issues and possible flaws for both A* and IDA* are discussed in detail.
Stefan Edelkamp, Peter Leven
openaire   +2 more sources

Integrating Automated and Interactive Theorem Proving

1998
Automated 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, Beckert, Bernhard, Hähnle, R., Menzel, Wolfram, Reif, Wolfgang, Schellhorn, Gerhard, Schmitt, Peter H.   +6 more
openaire   +3 more sources

Automated theorem proving for ?ukasiewicz logics

Studia Logica, 1993
The 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   +2 more sources

STRATEGY PARALLELISM IN AUTOMATED THEOREM PROVING

International Journal of Pattern Recognition and Artificial Intelligence, 1999
Automated 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   +2 more sources

Automated Theorem Proving

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   +2 more sources

Increasing the efficiency of automated theorem proving

Journal of Applied Non-Classical Logics, 1995
In this work a new Automated Theorem Prover (ATP) via refutation for classical logic and which does not require the conversion to clausal form, named TAS-D++, is introduced.
Inma P. de Guzmán, Gabriel Aguilera, Manuel Ojeda   +2 more
openaire   +2 more sources

Ordering in automated theorem proving of differential geometry

Acta Mathematicae Applicatae Sinica, 1998
The authors propose a new ordering method for automated theorem proving in differential geometry, called ``hybrid ordering method'', which is compatible with both, Cartan's method of moving frames and Wu's elimination principle. The basic idea is to change part of an element-based order to a degree-based order according to given hypotheses.
Li Hongbo, Cheng Minteh
openaire   +2 more sources

Automated theorem proving in temporal logic: T-resolution

Journal of Computer Science and Technology, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaokeng Zhao, Jun Dai, Wendan Chen
openaire   +3 more sources

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’.
Wolfgang Ahrendt, Martin A. Giese
openaire   +2 more sources

Automated theorem proving: the resolution method

ACM SIGSAM Bulletin, 1987
The 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   +2 more sources