A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• NP-complete problems
• Electronic design automation
• Formal methods
• Conflict-driven clause learning
• Boolean satisfiability problem
• Clause
• Unit propagation

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

Gap Amplification Fails Below 1/2 Andrej Bogdanov June 1, 2005 Abstract The gap amplification lemma of Dinur (ECCC TR05-46) states that the satisfiability gap

Source URL: www.cse.cuhk.edu.hk

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates Ra´ ul Guti´errez1 1 DSIC, 2 University

Source URL: www.sci.unich.it

2 Satisfiability Checking and Symbolic Computation (SC

Source URL: computing.coventry.ac.uk

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

Source URL: www.fields.utoronto.ca

• Logic
• Constraint programming
• Constraint satisfaction problem
• Model theory
• Abstraction
• Philosophy
• Constraint satisfaction
• Satisfiability
• Algebraic structure

Part 2: First-Order Logic 2.1 Syntax 2.2 Semantics 2.3 Models, Validity, Satisfiability 2.4 Algorithmic problems 2.5 Normal forms and Skolemization

Source URL: people.mpi-inf.mpg.de

• Logic
• Mathematical logic
• Mathematics
• Automated theorem proving
• Propositional calculus
• Rules of inference
• Resolution
• Boolean algebra
• Literal
• First-order logic
• SLD resolution
• Horn clause

Boolean Lexicographic Optimization Joao Marques-Silva1 , Josep Argelich2 , Ana Grac¸a3 , and Inˆes Lynce3 1 2 CSI/CASL, University College Dublin, Ireland

Source URL: ceur-ws.org

• Theoretical computer science
• Mathematics
• Mathematical optimization
• Numerical analysis
• Combinatorial optimization
• Operations research
• Constraint programming
• Logic in computer science
• Maximum satisfiability problem
• Linear programming
• Constrained optimization
• Solver

Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Source URL: www.mancoosi.org

• Theoretical computer science
• Logic in computer science
• Combinatorial optimization
• Maximum satisfiability problem
• Unit propagation
• Constraint programming
• Mathematics
• Mathematical logic