Generic theorem proving for decision procedures

[1]  Maria Paola Bonacina,et al.  On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal , 2005, FroCoS.

[2]  Sergey Berezin,et al.  CVC Lite: A New Implementation of the Cooperating Validity Checker Category B , 2004, CAV.

[3]  Henny B. Sipma,et al.  Decision Procedures for Recursive Data Structures with Integer Constraints , 2004, IJCAR.

[4]  Albert Oliveras,et al.  Congruence Closure with Integer Offsets , 2003, LPAR.

[5]  Michaël Rusinowitch,et al.  A rewriting approach to satisfiability procedures , 2003, Inf. Comput..

[6]  David L. Dill,et al.  CVC: A Cooperating Validity Checker , 2002, CAV.

[7]  David L. Dill,et al.  Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT , 2002, CAV.

[8]  Harald Ruess,et al.  Lazy Theorem Proving for Bounded Model Checking over Infinite Domains , 2002, CADE.

[9]  Andrei Voronkov,et al.  Handbook of Automated Reasoning: Volume 1 , 2001 .

[10]  Andrei Voronkov,et al.  Splitting Without Backtracking , 2001, IJCAI.

[11]  David L. Dill,et al.  A Framework for Cooperating Decision Procedures , 2000, CADE.

[12]  Andrei Voronkov,et al.  Automated deduction -- CADE-18 : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 : proceedings , 2002 .

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

[14]  D. Oppen.  Reasoning About Recursively Defined Data Structures , 1980, JACM.