Results 141 to 150 of about 307,150 (181)

Inductive theorem proving by consistency for first-order clauses

1992
We show how the method of proof by consistency can be extended to proving properties of the perfect model of a set of first-order clauses with equality. Technically proofs by consistency will be similar to proofs by case analysis over the term structure. As our method also allows to prove sufficient-completeness of function definitions in parallel with
Ganzinger, H., Stuber, J.
openaire   +3 more sources

The First-Order Complexity of First-Order Theorem Proving Strategies

1997
We would like to study the complexity of first-order theorem proving procedures. A first-order theorem prover typically takes as input a formula A of first-order logic and, if the formula is valid, eventually outputs a proof. Otherwise, the prover may run forever.
David A. Plaisted, Yunshan Zhu
openaire   +1 more source

Semantically guided first-order theorem proving using hyper-linking

1994
An automated theorem prover accepts a set of axioms and a theorem, expressed in a formal logic, and then proves that the theorem logically follows from the axioms. Two basic aspects of a logic are syntax and semantics. Syntax refers to the form of the statements and semantics refers to their meanings.
Chu, H., Plaisted, D.
openaire   +2 more sources

Automatic theorem proving in first order predicate logic

2022
This thesis was scanned from the print manuscript for digital preservation and is copyright the author. Researchers can access this thesis by asking their local university, institution or public library to make a request on their behalf. Monash staff and postgraduate students can use the link in the References field.
openaire   +1 more source

Conditional term rewriting and first-order theorem proving

1993
We survey some basic issues in first-order theorem proving and their implications for conditional term-rewriting systems. In particular, we discuss the propositional efficiency of theorem proving strategies, goal-sensitivity, and the use of semantics. We give several recommendations for theorem proving strategies to enable them to properly treat these ...
David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee   +3 more
openaire   +1 more source

Subsumption demodulation in first-order theorem proving

2019
Ensuring correctness of software is becoming increasingly important in modern society, but still poses a difficult challenge. Reasoning-based software verification addresses this challenge by proving various requirements on software correctness. Performing such proofs manually is however tedious and error-prone, calling for the need to automate ...
openaire   +1 more source

First-order theorem proving using conditional rewrite rules

2005
A method based on superposition on maximal literals in clauses and conditional rewriting is discussed for automatically proving theorems in first-order predicate calculus with equality. First-order formulae (clauses) are represented as conditional rewrite rules which turn out to be an efficient representation.
Hantao Zhang, Deepak Kapur
openaire   +1 more source

An equational approach to theorem proving in first-order predicate calculus

ACM SIGSOFT Software Engineering Notes, 1985
A new approach for proving theorems in first-order predicate calculus is developed based on term rewriting and polynomial simplification methods. A formula is translated into an equivalent set of formulae expressed in terms of 'true', 'false', 'exclusive-or', and 'and' by analyzing the semantics of its top-level operator.
Deepak Kapur, Paliath Narendran
openaire   +1 more source

Proving behavioural theorems with standard first-order logic

1994
Behavioural logic is a generalization of first-order logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to
Michel Bidoit, Rolf Hennicker
openaire   +1 more source

Advances in first-order theorem proving

2000
An international workshop on First-order Theorem Proving, FTP 1997, was organized by the guest editors in October 1997 at Schloss Hagenberg near Linz. Twenty-five extended abstracts were presented at the workshop and are available at http://www.logic.at/ftp97/.
BONACINA, Maria Paola, Ulrich Furbach
openaire   +1 more source