Encoding First Order Proofs in SAT

Authors:
Todd Deshane;Wenjin Hu;Patty Jablonski;Hai Lin;Christopher Lynch;Ralph Eric Mcgregor
Affiliations:
Clarkson University,;Clarkson University,;Clarkson University,;Clarkson University,;Clarkson University,;Clarkson University,
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 11
Cited 2

Theorem Proving via General Matings

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
The TPTP Problem Library

Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic

Journal of Automated Reasoning
The Complexity of Resource-Bounded First-Order Classical Logic

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Model elimination and connection tableau procedures

Handbook of automated reasoning
The design and implementation of VAMPIRE

AI Communications - CASC
Local search for unsatisfiability

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Encoding First Order Proofs in SMT

Electronic Notes in Theoretical Computer Science (ENTCS)
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau and the satisfiability of unification constraints. Then the first order theorem is rigidly unsatisfiable if and only if the encoding is propositionally satisfiable. We have implemented this method in our theorem prover CHEWTPTP, and present experimental results. This method can be useful for general first order problems, by continually adding more instances of each clause.