A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions

Audemard, Gilles and Bertoli, Piergiorgio and Cimatti, Alessandro and Kornilowicz, Artur and Sebastiani, Roberto (2002) A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. UNSPECIFIED. (In Press)

[img]
Preview
 PDF
Download (317Kb) | Preview

    Abstract

    The availability of decision procedures for combinations of boolean and linear mathematical propositions opens the ability to solve problems arising from real-world domains such as verification of timed systems and planning with resources. In this paper we present a general and efficient approach to the problem, based on two main ingredients. The first is a DPLL-based SAT procedure, for dealing efficiently with the propositional component of the problem. The second is a tight integration, within the DPLL architecture, of a set of mathematical deciders for theories of increasing expressive power. A preliminary experimental evaluation shows the potential of the approach.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: SAT, linear mathematical reasoning, integration of procedures
    Additional Information: In Proc. 18th "Int. Conference of Automated Deduction, CADE'02" LNAI series, Springer Verlag.
    Report Number: DIT-02-041
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    		 View Item