Albert Oliveras

Optim. Methods Softw., 2024

Extended Resolution Clause Learning via Dual Implication Points.

[BibT_eX]

[DOI]

CoRR, 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

Learning Shorter Redundant Clauses in SDCL Using MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 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]

Cristina Borralleras

ACM Trans. Comput. Log., 2019

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

Leonardo Mendonça de Moura

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

2013

6 Years of SMT-COMP.

[BibT_eX]

[DOI]

Clark W. Barrett

Morgan Deters

Aaron Stump

J. Autom. Reason., 2013

Proving termination of imperative programs using Max-SMT.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 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]

Cristina Borralleras

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]

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

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]

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]

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

2008

MiniMaxSAT: An Efficient Weighted Max-SAT solver.

[BibT_eX]

[DOI]

Federico Heras

J. Artif. Intell. Res., 2008

Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-Comp 2007).

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 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

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

Fast congruence closure and extensions.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Preface.

[BibT_eX]

[DOI]

Sava Krstic

Proceedings of the 5th International Workshop on Satisfiability Modulo Theories, 2007

MiniMaxSat: A New Weighted Max-SAT Solver.

[BibT_eX]

[DOI]

Federico Heras

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Challenges in Satisfiability Modulo Theories.

[BibT_eX]

[DOI]

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

2006

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

[BibT_eX]

[DOI]

Cesare Tinelli

J. ACM, 2006

On SAT Modulo Theories and Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Splitting on Demand in SAT Modulo Theories.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

SMT Techniques for Fast Predicate Abstraction.

[BibT_eX]

[DOI]

Shuvendu K. Lahiri

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

Proof-Producing Congruence Closure.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2005

DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

Abstract DPLL and Abstract DPLL Modulo Theories.

[BibT_eX]

[DOI]

Cesare Tinelli

Proceedings of the Logic for Programming, 2004

DPLL( T): Fast Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003

Congruence Closure with Integer Offsets.

[BibT_eX]

[DOI]