In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems.
Swipe to navigate through the chapters of this book
- Some Progress in Satisfiability Checking for Difference Logic
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA