Generalizing DPLL and satisfiability for equalities

B. Badban, J.C. Pol, van de, O. Tveretina, H. Zantema

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
2 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)1188-1211
JournalInformation and Computation
Issue number8
Publication statusPublished - 2007


Dive into the research topics of 'Generalizing DPLL and satisfiability for equalities'. Together they form a unique fingerprint.

Cite this