Generalizing DPLL and satisfiability for equalities

Authors:
Bahareh Badban;Jaco van de Pol;Olga Tveretina;Hans Zantema
Affiliations:
Centrum voor Wiskunde en Informatica, Department of Software Engineering, P.O. Box 94.079, 1090 GB Amsterdam, The Netherlands;Centrum voor Wiskunde en Informatica, Department of Software Engineering, P.O. Box 94.079, 1090 GB Amsterdam, The Netherlands and Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 M ...;Faculty of Science, University of Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands;Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Information and Computation
Year:
2007

Citing 17
Cited 3

Unification revisited

Foundations of deductive databases and logic programming
Equational problems anddisunification

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficient annotated terms

Software—Practice & Experience
A machine program for theorem-proving

Communications of the ACM
Combining Shostak Theories

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CVC: A Cooperating Validity Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Framework for Cooperating Decision Procedures

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
On the complexity of equational problems in CNF

Journal of Symbolic Computation - Special issue: First order theorem proving
Equational binary decision diagrams

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas

Electronic Notes in Theoretical Computer Science (ENTCS)
On progression and query evaluation in first-order knowledge bases with function symbols

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Abstract conflict driven learning

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic. Sufficient conditions are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL procedure is an instance. Subsequently the GDPLL instances for equality logic, and the logic of equality over infinite ground term algebras are presented. Based on this, we implemented a decision procedure for inductive datatypes. We provide some new benchmarks, in order to compare variants.