Satisfiability Coding Lemma Ramamohan Paturit, Pave1 Pud1d.k: and Francis Zanet Abstract property, the Satisfiability Coding Lemma, of the set of

Source URL: cseweb.ucsd.edu

LNCSA Tutorial on Satisfiability Modulo Theories

Source URL: yices.csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• DPLL algorithm
• Symbol
• Conjunctive normal form

Satisfiability Modulo Theories: ABsolver Michael Tautschnig Joint work with: Andreas Bauer Martin Leucker

Source URL: www.tautschnig.net

A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com

Source URL: yices.csl.sri.com

• Theoretical computer science
• Logic
• Mathematics
• Constraint programming
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Simplex algorithm
• Satisfiability

Pre-processing in Boolean Satisfiability Using Bounded -Consistency on Regions with Locally Difficult Constraint Setup

Source URL: iti.mff.cuni.cz

The Complexity of Satisfiability of Small Depth Circuits Chris Calabro, Russell Impagliazzo? , and Ramamohan Paturi?? Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92093-

Source URL: cseweb.ucsd.edu

XPath Satisfiability with Downward and Sibling Axes is Tractable under Most of Real-World DTDs

Source URL: dbpl2013.inria.fr

Optgen: A Generator for Local Optimizations Sebastian Buchwald Karlsruhe Institute of Technology Abstract. Every compiler comes with a set of local optimization rules,

Source URL: pp.info.uni-karlsruhe.de

• Software
• Compiler optimizations
• Computer programming
• Peephole optimization
• Superoptimization
• Constant folding
• Compiler
• Program optimization
• Satisfiability modulo theories
• Expression
• Static single assignment form
• GNU Compiler Collection

The Lovász Local Lemma and Satisfiability - Algorithmic Aspects

Source URL: conference.itcs.tsinghua.edu.cn

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC