Planning as Satisfiability: Heuristics Jussi Rintanen Institute for Integrated and Intelligent Systems, Griffith University, Queensland, Australia Abstract Reduction to SAT is a very successful approach to solving hard c

Source URL: pdfs.semanticscholar.org

Proofs in Satisfiability Modulo Theories Pascal Fontaine (Inria, Loria, U. Lorraine) SAT/SMT Summer School 2015 Stanford

Source URL: www.cs.nyu.edu

Journal on Satisfiability, Boolean Modeling and ComputationUniversal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories Francesco Alberti

Source URL: jsat.ewi.tudelft.nl

Model-Constructing Satisfiability Calculus A Model-Based Approach to SMT Dejan Jovanović SRI International

Source URL: www.cs.nyu.edu

QCIR-G14: A Non-Prenex Non-CNF Format for Quantified Boolean Formulas QBF Gallery 2014 http://qbf.satisfiability.org/gallery/ April 8, 2014

Source URL: qbf.satisfiability.org

Journal on Satisfiability, Boolean Modeling and Computation–76 DepQBF: A Dependency-Aware QBF Solver system description Florian Lonsing Armin Biere

Source URL: jsat.ewi.tudelft.nl

Microsoft Word - BlankPage

Source URL: www.cs.miami.edu

• Logic
• Abstraction
• Philosophy
• Automated theorem proving
• Reasoning
• Formal methods
• Predicate logic
• Datalog
• First-order logic
• Axiom
• Satisfiability modulo theories
• Mereology

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

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