Orderings in Automated Theorem Proving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 1998

Orderings in Automated Theorem Proving


This paper is intended to give an introduction to several techniques used in automated theorem proving, and based on the concept of ordering on terms and more generally on formulas. Different orderings and their automation are presented and several applications are considered. We show how orderings provide a way to incorporate equality decision procedures in theorem provers. We also illustrate their fundamental role to automatise proofs by induction and proofs by refutation. Finally, we explain how they allow pruning the search space of a theorem prover by defining strategies to restrict application of inference rules.


Other [cs.OH]
Not file

Dates and versions

inria-00098418 , version 1 (25-09-2006)


  • HAL Id : inria-00098418 , version 1


Hélène Kirchner. Orderings in Automated Theorem Proving. Hoffman, Frederick. Mathematical Aspects of Artificial Intelligence, American Mathematical Society, pp.55-95, 1998, Proceedings of Symposia in Applied Mathematics. ⟨inria-00098418⟩
107 View
0 Download


Gmail Facebook Twitter LinkedIn More