Author of the publication

Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T).

, , and . J. ACM, 53 (6): 937-977 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Simple LPO Constraint Solving Methods.. Inf. Process. Lett., 47 (2): 65-69 (1993)A New Look at BDDs for Pseudo-Boolean Constraints., , , , and . J. Artif. Intell. Res., (2012)On Narrowing, Refutation Proofs and Constraints.. RTA, volume 914 of Lecture Notes in Computer Science, page 56-70. Springer, (1995)Solved Forms for Path Ordering Constraints., and . RTA, volume 1631 of Lecture Notes in Computer Science, page 1-15. Springer, (1999)DPLL( T): Fast Decision Procedures., , , , and . CAV, volume 3114 of Lecture Notes in Computer Science, page 175-188. Springer, (2004)Invited Talk: Rewrite-based Deduction and Symbolic Constraints.. CADE, volume 1632 of Lecture Notes in Computer Science, page 302-313. Springer, (1999)On SAT Modulo Theories and Optimization Problems., and . SAT, volume 4121 of Lecture Notes in Computer Science, page 156-169. Springer, (2006)Superposition with completely built-in Abelian groups., and . J. Symb. Comput., 37 (1): 1-33 (2004)Basic Paramodulation and Decidable Theories (Extended Abstract).. LICS, page 473-482. IEEE Computer Society, (1996)On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups., and . LICS, page 38-47. IEEE Computer Society, (2001)