From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain

Sebastiani, Roberto (2007) From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain. LNCS; 4720 . Berlin ; Heidelberg : Springer. - (Lecture Notes in Computer Science; 4720), pp. 28-46.

Download (324Kb) | Preview


    In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractable problems at the reach of state-of-the-art SAT solvers. Most of this success is motivated by the impressive level of efficiency reached by current implementations of the DPLL procedure. Plain propositional logic, however, is not the only application domain for DPLL. In fact, DPLL has also been successfully used as a boolean-reasoning kernel for automated reasoning tools in much more expressive logics. In this talk I overview a 12-year experience on integrating DPLL with logic-specific decision procedures in various domains. In particular, I present and discuss three main achievements which have been obtained in this context: the DPLL-based procedures for modal and description logics, the lazy approach to Satisfiability Modulo Theories, and Delayed Theory Combination. The original publication is available at DOI: 10.1007/978-3-540-74621-8_2

    Item Type: Conference paper
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: SAT, SMT, DPLL
    Additional Information: Invited talk.
    Repository staff approval on: 19 Feb 2008

    Actions (login required)

    View Item