Abstract
In the context of DPLL(T), theory propagation is the process of dynamically selecting consequences of a conjunction of constraints from a given set of candidate constraints. We present improvements to a fast theory propagation procedure for difference constraints of the form x-y ≤ c. These improvements are demonstrated experimentally. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Cotton, S., & Maler, O. (2006). Fast and flexible difference constraint propagation for DPLL(T). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4121 LNCS, pp. 170–183). Springer Verlag. https://doi.org/10.1007/11814948_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
