Abstract
In this paper we report a new SAT solver for difference logic, a prepositional 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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Cotton, S., Asarin, E., Maler, O., & Niebert, P. (2004). Some progress in satisfiability checking for difference logic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3253, 263–276. https://doi.org/10.1007/978-3-540-30206-3_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
