Journal of Automated Reasoning

, Volume 44, Issue 4, pp 401–424

Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

  • Ruzica Piskac
  • Leonardo de Moura
  • Nikolaj Bjørner
Article

DOI: 10.1007/s10817-009-9161-6

Cite this article as:
Piskac, R., de Moura, L. & Bjørner, N. J Autom Reasoning (2010) 44: 401. doi:10.1007/s10817-009-9161-6

Abstract

We introduce a DPLL calculus that is a decision procedure for the Bernays-Schönfinkel class, also known as EPR. Our calculus allows combining techniques for efficient propositional search with data-structures, such as Binary Decision Diagrams, that can efficiently and succinctly encode finite sets of substitutions and operations on these. In the calculus, clauses comprise of a sequence of literals together with a finite set of substitutions; truth assignments are also represented using substitution sets. The calculus works directly at the level of sets, and admits performing simultaneous constraint propagation and decisions, resulting in potentially exponential speedups over existing approaches.

Keywords

DPLLSATBDDsEffectively propositional logic

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  • Ruzica Piskac
    • 1
  • Leonardo de Moura
    • 1
  • Nikolaj Bjørner
    • 1
  1. 1.Microsoft ResearchRedmondUSA