New directions in instantiation-based theorem proving

We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by proposition tests. We give a model construction proof of completeness by which restrictive inference systems as well as admissible simplification techniques can be justified. Another contribution of the paper are inference systems that allow one to also employ decision procedures for first-order fragments more complex than propositional logic. The decision provides for an approximate consistency test, and the instance generation inference system is a means of successively refining the approximation.

[1]  David A. Plaisted,et al.  Ordered Semantic Hyper-Linking , 1997, Journal of Automated Reasoning.

[2]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[3]  Andrei Voronkov,et al.  Stratified resolution , 2000, J. Symb. Comput..

[4]  John N. Hooker,et al.  Partial Instantiation Methods for Inference in First-Order Logic , 2002, Journal of Automated Reasoning.

[5]  Jean-Paul Billon,et al.  The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework , 1996, TABLEAUX.

[6]  Fausto Giunchiglia,et al.  A Theory of Abstraction , 1992, Artif. Intell..

[7]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[8]  Daniel Jackson,et al.  Alloy: a lightweight object modelling notation , 2002, TSEM.

[9]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[10]  Andrei Voronkov,et al.  Stratified Resolution , 2000, CADE.

[11]  Reinhold Letz,et al.  Integration of Equality Reasoning into the Disconnection Calculus , 2002, TABLEAUX.

[12]  James R. Slagle,et al.  Theorem proving , 2003 .

[13]  Christian G. Fermüller,et al.  Hyperresolution and Automated Model Building , 1996, J. Log. Comput..

[14]  Reinhold Letz,et al.  Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux , 2001, LPAR.

[15]  Reiner Hähnle,et al.  Ordered Resolution vs. Connection Graph Resolution , 2001, IJCAR.

[16]  Christian G. Fermüller,et al.  Resolution Decision Procedures , 2001, Handbook of Automated Reasoning.

[17]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[18]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[19]  Peter Baumgartner,et al.  FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure , 2000, CADE.

[20]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[21]  Peter Graf.  Substitution Tree Indexing , 1995, RTA.

[22]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[23]  Daniel Jackson.  Automating first-order relational logic , 2000, SIGSOFT '00/FSE-8.

[24]  Ricardo Caferra,et al.  A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving , 1992, J. Symb. Comput..

[25]  Harald Ganzinger,et al.  Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality , 1993, Kurt Gödel Colloquium.

[26]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[27]  Harald Ganzinger,et al.  Context Trees , 2001, IJCAR.