The following pages link to Albert Oliveras (Q438574):
Displaying 31 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Fast congruence closure and extensions (Q876046) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- BDDs for Pseudo-Boolean Constraints – Revisited (Q3007674) (← links)
- Semiring-Induced Propositional Logic: Definition and Basic Algorithms (Q3066107) (← links)
- A New Look at BDDs for Pseudo-Boolean Constraints (Q3143578) (← links)
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (Q3192080) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- (Q3408132) (← links)
- Solving SAT and SAT Modulo Theories (Q3455223) (← links)
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (Q3502696) (← links)
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers (Q3568227) (← links)
- (Q3624109) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- (Q4232673) (← links)
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers (Q4972164) (← links)
- Computer Aided Verification (Q5312898) (← links)
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools (Q5387828) (← links)
- Splitting on Demand in SAT Modulo Theories (Q5387916) (← links)
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints (Q5415453) (← links)
- Challenges in Satisfiability Modulo Theories (Q5432330) (← links)
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT (Q5505540) (← links)
- Term Rewriting and Applications (Q5703869) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705940) (← links)
- Computer Aided Verification (Q5716574) (← links)
- On SAT Modulo Theories and Optimization Problems (Q5756563) (← links)
- IntSat: integer linear programming by conflict-driven constraint learning (Q6585824) (← links)
- Learning shorter redundant clauses in SDCL using MaxSAT (Q6643095) (← links)
