Enric Rodríguez-Carbonell

Rui Zhao

Proceedings of the 28th International Conference on Theory and Applications of Satisfiability Testing, 2025

2024

IntSat: integer linear programming by conflict-driven constraint learning.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2024

Speeding up Pseudo-Boolean Propagation.

[BibT_eX]

[DOI]

Rui Zhao

Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

2023

Analyzing Multiple Conflicts in SAT: An Experimental Evaluation.

[BibT_eX]

[DOI]

Rui Zhao

Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

2021

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving.

[BibT_eX]

[DOI]

Emma Rollon

IEEE Access, 2021

A Heuristic Approach to the Design of Optimal Cross-Docking Boxes.

[BibT_eX]

[DOI]

IEEE Access, 2021

2020

Decision levels are stable: towards better SAT heuristics.

[BibT_eX]

[DOI]

Adrià Lozano

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

Corrections to "Jutge.org: Characteristics and Experiences".

[BibT_eX]

[DOI]

Enric Rubio

Enric de San Pedro

Divya Venkataramani

IEEE Trans. Learn. Technol., 2019

2018

Jutge.org: Characteristics and Experiences.

[BibT_eX]

[DOI]

Enric Rubio

Enric de San Pedro

Divya Venkataramani

IEEE Trans. Learn. Technol., 2018

2017

Proving Termination Through Conditional Termination.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016

Speeding up the Constraint-Based Method in Difference Logic.

[BibT_eX]

[DOI]

Lorenzo Candeago

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015

Compositional Safety Verification with Max-SMT.

[BibT_eX]

[DOI]

Marc Brockschmidt

Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014

Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Proving Non-termination Using Max-SMT.

[BibT_eX]

[DOI]

Kaustubh Nimkar

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013

The recursive path and polynomial ordering for first-order and higher-order terms.

[BibT_eX]

[DOI]

Miquel Bofill

J. Log. Comput., 2013

SMT-Based Array Invariant Generation.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2013

Proving termination of imperative programs using Max-SMT.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2013

Fun in CS2.

[BibT_eX]

[DOI]

Amalia Duch

Jordi Petit

Salvador Roura

Proceedings of the CSEDU 2013, 2013

To Encode or to Propagate? The Best Choice for Each Constraint in SAT.

[BibT_eX]

[DOI]

Peter J. Stuckey

Proceedings of the Principles and Practice of Constraint Programming, 2013

A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

SAT Modulo Linear Arithmetic for Solving Polynomial Constraints.

[BibT_eX]

[DOI]

Salvador Lucas

J. Autom. Reason., 2012

A New Look at BDDs for Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Valentin Mayer-Eichberger

J. Artif. Intell. Res., 2012

2011

A Framework for Certified Boolean Branch-and-Bound Optimization.

[BibT_eX]

[DOI]

Javier Larrosa

J. Autom. Reason., 2011

Cardinality Networks: a theoretical and empirical study.

[BibT_eX]

[DOI]

Roberto Asín

Constraints An Int. J., 2011

BDDs for Pseudo-Boolean Constraints - Revisited.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Hard problems in max-algebra, control theory, hypergraphs and other areas.

[BibT_eX]

[DOI]

Marc Bezem

Inf. Process. Lett., 2010

Preface.

[BibT_eX]

[DOI]

Antoine Miné

Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010

Practical algorithms for unsatisfiability proof and core generation in SAT solvers.

[BibT_eX]

[DOI]

Roberto Javier Asín Achá

AI Commun., 2010

Semiring-Induced Propositional Logic: Definition and Basic Algorithms.

[BibT_eX]

[DOI]

Javier Larrosa

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates.

[BibT_eX]

[DOI]

Javier Larrosa

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Cardinality Networks and Their Applications.

[BibT_eX]

[DOI]

Roberto Asín

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.

[BibT_eX]

[DOI]

Salvador Lucas

Rafael Navarro-Marset

Proceedings of the Automated Deduction, 2009

2008

Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra.

[BibT_eX]

[DOI]

Marc Bezem

Discret. Appl. Math., 2008

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers.

[BibT_eX]

[DOI]

Germain Faure

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

The Max-Atom Problem and Its Relevance.

[BibT_eX]

[DOI]

Marc Bezem

Proceedings of the Logic for Programming, 2008

Efficient Generation of Unsatisfiability Proofs and Cores in SAT.

[BibT_eX]

[DOI]

Roberto Asín

Proceedings of the Logic for Programming, 2008

A Write-Based Solver for SAT Modulo the Theory of Arrays.

[BibT_eX]

[DOI]

Miquel Bofill

Proceedings of the Formal Methods in Computer-Aided Design, 2008

The Barcelogic SMT Solver.

[BibT_eX]

[DOI]

Miquel Bofill

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007

Automatic generation of polynomial invariants of bounded degree using abstract interpretation.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2007

Generating all polynomial invariants in simple loops.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Challenges in Satisfiability Modulo Theories.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2005

Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.

[BibT_eX]

[DOI]

Roberto Bagnara

Enea Zaffanella

Proceedings of the Static Analysis, 12th International Symposium, 2005

Generating Polynomial Invariants for Hybrid Systems.

[BibT_eX]

[DOI]

Ashish Tiwari

Proceedings of the Hybrid Systems: Computation and Control, 8th International Workshop, 2005

Derivation of Non-structural Invariants of Petri Nets Using Abstract Interpretation.

[BibT_eX]

[DOI]

Robert Clarisó

Jordi Cortadella

Proceedings of the Applications and Theory of Petri Nets 2005, 2005

2004

An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 11th International Symposium, 2004

Automatic generation of polynomial loop.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

Program Verification Using Automatic Generation of Invariants.

[BibT_eX]

[DOI]