Author of the publication

Constructing Cycles in the Simplex Method for DPLL(T).

, and . ICTAC, volume 10580 of Lecture Notes in Computer Science, page 213-228. Springer, (2017)

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

Tyrolean Termination Tool 2., , , and . RTA, volume 5595 of Lecture Notes in Computer Science, page 295-304. Springer, (2009)Simple Termination is Difficult., and . RTA, volume 690 of Lecture Notes in Computer Science, page 228-242. Springer, (1993)Proving Termination of Rewrite Systems Using Bounds., and . RTA, volume 4533 of Lecture Notes in Computer Science, page 273-287. Springer, (2007)A Complete Selection Function for Lazy Conditional Narrowing., and . FLOPS, volume 2024 of Lecture Notes in Computer Science, page 201-215. Springer, (2001)AC-KBO Revisited., , , and . FLOPS, volume 8475 of Lecture Notes in Computer Science, page 319-335. Springer, (2014)Equational Termination by Semantic Labelling., , and . CSL, volume 1862 of Lecture Notes in Computer Science, page 457-471. Springer, (2000)Lazy Narrowing: Strong Completeness and Eager Variable Elimination., , and . UNIF, page 43-46. (1995)Polynomial Termination Over ℕ Is Undecidable., and . FSCD, volume 228 of LIPIcs, page 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Conditional Complexity., , and . RTA, volume 36 of LIPIcs, page 223-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence., , and . RTA, volume 21 of LIPIcs, page 335-351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)