Piergiorgio Bertoli, Artur Kornilowicz, Roberto Sebastiani, Alessandro Cimatti, Gilles Audemard

2002, Note: In Proc. 18th "Int. Conference of Automated Deduction, CADE'02" LNAI series, Springer Verlag.

Keywords: SAT, linear mathematical reasoning, integration of procedures

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.