qbflib.org

beyondnp.org

QBF Solvers | Beyond NP

http://beyondnp.org/pages/solvers/qbf-solvers

Keeping up with solvers that reach beyond NP! QBF solvers can applied to problems in the Polynomial Hierarchy (PH). Often, problems are specified via quantified CNF formulas, although a number of other formats exist. Based on QDPLL, with conflict-driven clause and solution-driven cube learning. DPLL-based solver that uses ghost variables to achieve symmetry in handling of universal/existential variables. Based on recursively using counterexample abstraction refinement (CEGAR). And the QBF Gallery.

sakabe.nuie.nagoya-u.ac.jp

酒井正彦 ホームページ

http://www.sakabe.nuie.nagoya-u.ac.jp/~sakai

工学部 電気電子 情報工学科 情報工学コース. 擬ブール制約ソルバ NaPS (the Nagoya pseudo-Boolean constraint solver). Rewritng Home Page へのリンク. The Quantified Boolean Formula Satisfiability Library. WPTE 2016 - 3rd International Workshop on Rewriting Techniques for Program Transformations and Evaluation. WPTE 2015 - 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation. WPTE 2014 - 1st International Workshop on Rewriting Techniques for Program Transformations and Evaluation.

smtlib.cs.uiowa.edu

SMT-LIB The Satisfiability Modulo Theories Library

http://smtlib.cs.uiowa.edu/related.shtml

The Satisfiability Modulo Theories Library. The SMT solver competition. The International Workshop on Satisfiability Modulo Theories. The benchmark repository and execution service current used by SMT-LIB and SMT-COMP. The benchmark repository and execution service previouly used by SMT-LIB and SMT-COMP. This service is no longer active although it still contains historical data. The following sites are related or have similar objectives to those of SMT-LIB. Based on a design by Blue Web Templates.

fmv.jku.at

Quantor

http://fmv.jku.at/quantor

Quantor-3.2.tar.gz. Since the initial release of quantor we worked on minor internal improvements. The basic algorithm has not changed except for extracting functional dependencies as also used in SATeLite. Self subsuming resolution does not work correctly in the context of QBF. Both features are described in our paper "Effective Preprocessing in SAT through Variable and Clause Elimination". You may want to have a look at the README. File, and the installation instructions, contained in the INSTALL.

satassociation.org

Officers

http://www.satassociation.org/officers.html

DPLL, CDCL, SLS, GB, SMT, BDD, AIG, MAX-SAT, Equiv Check, Model Check, more . Since 2004 Prof. Armin Biere chairs the Institute for Formal Models and Verification at the Johannes Kepler University in Linz, Austria. Assistant editor of Annals of Mathematics and Artificial Intelligence. Theory editor of the Encyclopedia of Computer Science and Engineering. And has co-edited several special issues of AMAI. And Discrete Applied Mathematics. Hans Kleine Büning received the Doctor Rerum Naturalium from We...

pragmaticsofssat.org

Pragmatics of SAT 2012

http://www.pragmaticsofssat.org/2012

Pragmatics of SAT 2012. A workshop of the SAT 2012 conference. June 16, 2012, Trento, Italy. Has been designed with the help of SAT technology, while the device drivers of Windows 7. Are being certified thanks to an SMT solver (based on a SAT solver). Designing efficient SAT solvers requires both a good theoretical knowledge about the design of SAT solvers, i.e. how are interacting all its components, and a deep practical knowledge about how to implement efficiently such components. The third edition tak...

pragmaticsofsat.org

Pragmatics of SAT 2012

http://www.pragmaticsofsat.org/2012

Pragmatics of SAT 2012. A workshop of the SAT 2012 conference. June 16, 2012, Trento, Italy. Has been designed with the help of SAT technology, while the device drivers of Windows 7. Are being certified thanks to an SMT solver (based on a SAT solver). Designing efficient SAT solvers requires both a good theoretical knowledge about the design of SAT solvers, i.e. how are interacting all its components, and a deep practical knowledge about how to implement efficiently such components. The third edition tak...

beyondnp.org

Benchmarks | Beyond NP

http://beyondnp.org/pages/benchmarks

Keeping up with solvers that reach beyond NP! Some benchmarks for evaluating Solvers. Benchmarks for Model Counting. Benchmarks for Weighted Model Counting. Benchmarks for Weighted (Partial) MaxSAT.

satassociation.org

Scrapbook

http://www.satassociation.org/scrapbook.html

DPLL, CDCL, SLS, GB, SMT, BDD, AIG, MAX-SAT, Equiv Check, Model Check, more . SAT 2015, Austin, Texas, USA. SAT 2014, Wien, Österreich. SAT 2013, Helsinki, Finland. SAT 2012, Trento, Italia. SAT Interactions, 2012, Dagstuhl, Germany. SAT Conference, 2011, Ann Arbor, Michigan, USA. SAT Conference, 2009, Swansea, UK. SAT Next Generation SAT Solvers, 2009, Dagstuhl, Germany. SAT Conference, 2008, Guangzhou, China. SAT Symposium, 2006, Guangzhou, China. SAT Symposium, 2004, Guangzhou, China.