Model Evolution-Based Theorem Proving

The area of automated theorem proving is characterized by the development of numerous calculi and proof procedures, from general purpose to rather specialized ones for specific subsets of first-order logic and logical theories. This article highlights two trends that have received considerable attention over the last 10 years. One is the integration of reasoning methods for propositional and for first-order logic, with a best-of-both-worlds motivation. The other is built-in reasoning support modulo background theories, such as equality and integer arithmetic, which are of pivotal importance for, for example, software verification applications. This survey of the major paradigms in this space comes from the perspective of my own developments, mainly the model evolution calculus. This is an ongoing quest for the convergence of automated reasoning methods.

[1]  Peter Baumgartner,et al.  The model evolution calculus as a first-order DPLL method , 2008, Artif. Intell..

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

[3]  Peter Baumgartner,et al.  (LIA) - Model Evolution with Linear Integer Arithmetic Constraints , 2008, LPAR.

[4]  Harald Ganzinger,et al.  New directions in instantiation-based theorem proving , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[5]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

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

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

[8]  Peter Baumgartner,et al.  Model Evolution with equality - Revised and implemented , 2012, J. Symb. Comput..

[9]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

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

[11]  Peter Baumgartner,et al.  Hierarchic Superposition with Weak Abstraction , 2013, CADE.

[12]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[13]  Peter Baumgartner,et al.  A Combined Superposition and Model Evolution Calculus , 2010, Journal of Automated Reasoning.

[14]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

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

[16]  Maria Paola Bonacina,et al.  New results on rewrite-based satisfiability procedures , 2006, TOCL.

[17]  Peter Baumgartner,et al.  Lemma Learning in the Model Evolution Calculus , 2006, LPAR.

[18]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[19]  Keri Schreiner,et al.  IEEE Computer Society Publications Office , 2006 .

[20]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[21]  Peter Baumgartner,et al.  Model Evolution with Equality Modulo Built-in Theories , 2011, CADE.