To Encode or to Propagate? The Best Choice for Each Constraint in SAT Ignasi Ab´ıo1 , Robert Nieuwenhuis2 , Albert Oliveras2 , Enric Rodr´ıguez-Carbonell2 , Peter J. Stuckey3 1

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint satisfaction
• Satisfiability modulo theories
• Boolean satisfiability problem
• Maximum satisfiability problem
• Decomposition method
• Constraint

Compositional Safety Verification with Max-SMT Marc Brockschmidt ∗ , Daniel Larraz † , Albert Oliveras † , Enric Rodr´ıguez-Carbonell † and Albert Rubio

Source URL: www.lsi.upc.edu

• Formal methods
• Software engineering
• Theoretical computer science
• Predicate transformer semantics
• Computing
• Loop invariant
• Invariant
• 120-cell

BDDs for Pseudo-Boolean Constraints – Revisited Ignasi Ab´ıo, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodr´ıguez-Carbonell? Abstract. Pseudo-Boolean constraints are omnipresent in practical applications, and

Source URL: www.lsi.upc.edu

• Boolean algebra
• Constraint programming
• Diagrams
• Binary decision diagram
• Model checking
• Theoretical computer science
• Mathematics
• Local consistency
• Computing
• Propositional directed acyclic graph

A Write-Based Solver for SAT Modulo the Theory of Arrays Miquel Bofill Universitat de Girona Robert Nieuwenhuis

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Mathematics
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Array data type
• Literal
• Matrix

Model Based Theory Combination SMT 2007 Leonardo de Moura and Nikolaj Bjørner {leonardo, nbjorner}@microsoft.com. Microsoft Research

Source URL: www.lsi.upc.edu

• Logic
• Mathematical logic
• Theoretical computer science
• Model theory
• Logic in computer science
• Logical truth
• Philosophy of logic
• Satisfiability
• Convex function
• Universal quantification
• Boolean satisfiability problem

SMT Workshop’07 5th International Workshop on Satisfiability Modulo Theories (Previously called PDPAR: Pragmatics of Decision Procedures in Automated Reasoning) Affiliated with CAV’07 Berlin, Germany, 1-2 July 2007

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Logic in computer science
• Formal methods
• Logic
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Formal verification
• SMT
• Automated reasoning
• Satisfiability

Efficient Generation of Unsatisfiability Proofs and Cores in SAT Roberto As´ın, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. Some modern DPLL-based propositional SAT solvers now have fas

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Mathematics
• Logic in computer science
• Propositional calculus
• Constraint programming
• DPLL algorithm
• Logic programming
• Boolean satisfiability problem
• Unsatisfiable core
• Maximum satisfiability problem

Solving Quantified Verification Conditions using Satisfiability Modulo Theories Yeting Ge, Clark Barrett, Cesare Tinelli Solving Quantified Verification Conditions using Satisfiability Modulo Theories – p.1/28

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Formal methods
• Logic
• Mathematical logic
• Logic in computer science
• Model theory
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Automated theorem proving
• First-order logic
• Satisfiability

Proving Termination of Imperative Programs Using Max-SMT Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain Abstract—We show how Max-SMT

Source URL: www.lsi.upc.edu

PDF Document

Source URL: nlp.lsi.upc.edu