A SAT-based decision procedure for the boolean combination of difference constraints

  • Authors:

  • Alessandro Armando;Claudio Castellini;Enrico Giunchiglia;Marco Maratea

  • Affiliations:

  • AILab, DIST, University of Genova, Genova, Italy;AILab, DIST, University of Genova, Genova, Italy;STARLab, DIST, University of Genova, Genova, Italy;STARLab, DIST, University of Genova, Genova, Italy

  • Venue:
  • SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of deciding satisfiability of Boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling and bounded model checking of real-time systems. Efficient decision procedures for this class of formulas are, therefore, strongly needed. In this paper we present TSAT++, a system implementing a SAT-based decision procedure for this problem, and the techniques implemented in it; in particular, TSAT++ takes full advantage of recent SAT techniques. Comparative experimental results indicate that TSAT++ outperforms its competitors both on randomly generated, hand-made and real world problems.