Albert Oliveras

发表

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

Cesare Tinelli, Albert Oliveras, Robert Nieuwenhuis, 2006, JACM.

DPLL( T): Fast Decision Procedures

Cesare Tinelli, Albert Oliveras, Harald Ganzinger, 2004, CAV.

Compositional safety verification with Max-SMT

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2015, 2015 Formal Methods in Computer-Aided Design (FMCAD).

Survey of satisfiability modulo theories (SMT)

Albert Oliveras, 2014 .

Barcelogic SAT Solver: System description

Morgan Deters, R. Nieuwenhuis, Albert Oliveras, 2006 .

Practical algorithms for unsatisfiability proof and core generation in SAT solvers

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2010, AI Commun..

Speeding up the Constraint-Based Method in Difference Logic

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2016, SAT.

Semiring-Induced Propositional Logic: Definition and Basic Algorithms

Albert Oliveras, Enric Rodríguez-Carbonell, Javier Larrosa, 2010, LPAR.

6 Years of SMT-COMP

Clark W. Barrett, Aaron Stump, L. D. Moura, 2013, Journal of Automated Reasoning.

SMT Techniques for Fast Predicate Abstraction

Albert Oliveras, Shuvendu K. Lahiri, Robert Nieuwenhuis, 2006, CAV.

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

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2005, CAV.

A New Look at BDDs for Pseudo-Boolean Constraints pdf

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2012, J. Artif. Intell. Res..

Proof-Producing Congruence Closure

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2005, RTA.

Efficient Generation of Unsatisfiability Proofs and Cores in SAT

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2008, LPAR.

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

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2019, ACM Trans. Comput. Log..

Fast congruence closure and extensions

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2007, Inf. Comput..

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

Albert Oliveras, Aaron Stump, Clark W. Barrett, 2008, Int. J. Artif. Intell. Tools.

On SAT Modulo Theories and Optimization Problems

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2006, SAT.

Proving Termination Through Conditional Termination

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2017, TACAS.

Abstract DPLL and Abstract DPLL Modulo Theories

Cesare Tinelli, Albert Oliveras, Robert Nieuwenhuis, 2005, LPAR.

Proving termination of imperative programs using Max-SMT

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2013, 2013 Formal Methods in Computer-Aided Design.

Splitting on Demand in SAT Modulo Theories

Cesare Tinelli, Albert Oliveras, Robert Nieuwenhuis, 2006, LPAR.

Congruence Closure with Integer Offsets

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2003, LPAR.

BDDs for Pseudo-Boolean Constraints - Revisited

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2011, SAT.

The Barcelogic SMT Solver

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2008, CAV.

SAT Modulo Linear Arithmetic for Solving Polynomial Constraints

Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, 2010, Journal of Automated Reasoning.

Proving Non-termination Using Max-SMT

Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, 2014, CAV.

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

Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, 2014, SAT.

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

Albert Oliveras, Enric Rodríguez-Carbonell, Javier Larrosa, 2009, SAT.

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

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2008, SAT.

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

Albert Oliveras, Robert Nieuwenhuis, Enric Rodríguez-carbonell, 2021, IEEE Access.

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2021, IEEE Access.

A Framework for Certified Boolean Branch-and-Bound Optimization

Albert Oliveras, Enric Rodríguez-Carbonell, Javier Larrosa, 2010, Journal of Automated Reasoning.

A Framework for Certified Boolean Branch-and-Bound Optimization

J. Larrosa, R. Nieuwenhuis, Albert Oliveras, 2010, Journal of Automated Reasoning.

Cardinality Networks: a theoretical and empirical study

Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, 2011, Constraints.

MiniMaxSAT: An Efficient Weighted Max-SAT solver

Albert Oliveras, Javier Larrosa, Federico Heras, 2008, J. Artif. Intell. Res..

MiniMaxSat: A New Weighted Max-SAT Solver

Albert Oliveras, Javier Larrosa, Federico Heras, 2007, SAT.

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

Albert Oliveras, Robert Nieuwenhuis, R. Nieuwenhuis, 2005, LPAR.

Challenges in Satisfiability Modulo Theories

Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio, 2007, RTA.

Analyzing Multiple Conflicts in SAT: An Experimental Evaluation

Albert Oliveras, Enric Rodríguez-carbonell, Rui Zhao, 2023, LPAR.