| Publication | Date of Publication | Type |
|---|
| Learning shorter redundant clauses in SDCL using MaxSAT | 2024-11-26 | Paper |
IntSat: integer linear programming by conflict-driven constraint learning
Optimization Methods & Software | 2024-08-12 | Paper |
Proving termination through conditional termination
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Incomplete SMT techniques for solving non-linear formulas over the integers
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Speeding up the constraint-based method in difference logic
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
Journal of the ACM | 2015-12-04 | Paper |
Minimal-model-guided approaches to solving polynomial constraints and extensions
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A parametric approach for smaller and better encodings of cardinality constraints
Lecture Notes in Computer Science | 2014-05-12 | Paper |
A New Look at BDDs for Pseudo-Boolean Constraints
Journal of Artificial Intelligence Research | 2012-12-03 | Paper |
SAT modulo linear arithmetic for solving polynomial constraints
Journal of Automated Reasoning | 2012-07-31 | Paper |
BDDs for pseudo-Boolean constraints -- revisited
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Cardinality networks: a theoretical and empirical study
Constraints | 2011-05-25 | Paper |
A framework for certified Boolean branch-and-bound optimization
Journal of Automated Reasoning | 2011-04-05 | Paper |
Semiring-induced propositional logic: definition and basic algorithms
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications | 2010-06-17 | Paper |
| Congruence closure with integer offsets | 2010-02-24 | Paper |
Cardinality Networks and Their Applications
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
Lecture Notes in Computer Science | 2009-07-07 | Paper |
| Minimaxsat: an efficient weighted Max-SAT solver | 2009-04-28 | Paper |
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Splitting on Demand in SAT Modulo Theories
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Challenges in Satisfiability Modulo Theories
Lecture Notes in Computer Science | 2008-01-02 | Paper |
On SAT Modulo Theories and Optimization Problems
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Fast congruence closure and extensions
Information and Computation | 2007-04-16 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 1262700 (Why is no real title available?) | 1999-03-15 | Paper |
