| Publication | Date of Publication | Type |
|---|
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 |
SMT-based array invariant generation
Lecture Notes in Computer Science | 2014-11-03 | 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 |
The recursive path and polynomial ordering for first-order and higher-order terms
Journal Of Logic And Computation | 2013-04-19 | 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 |
Hard problems in max-algebra, control theory, hypergraphs and other areas
Information Processing Letters | 2010-09-02 | Paper |
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications | 2010-06-17 | Paper |
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Automated Deduction – CADE-22 | 2009-07-28 | 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 |
Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
Discrete Applied Mathematics | 2009-03-04 | Paper |
The Max-Atom Problem and Its Relevance
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-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 |
Generating all polynomial invariants in simple loops
Journal of Symbolic Computation | 2007-10-23 | Paper |
Automatic generation of polynomial invariants of bounded degree using abstract interpretation
Science of Computer Programming | 2007-01-22 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Applications and Theory of Petri Nets 2005
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Theoretical Aspects of Computing - ICTAC 2004
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automatic Generation of Polynomial Loop Invariants
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
