Theory and Applications of Satisfiability Testing

DOI10.1007/b137280zbMath1128.68366OpenAlexW2497844642MaRDI QIDQ5713732

Nachum Dershowitz, Ziyad Hanna, Jacob Katz

Publication date: 15 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers, QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving, Unnamed Item, Unified QBF certification and its applications, Deciding Effectively Propositional Logic Using DPLL and Substitution Sets, Abstraction-Based Algorithm for 2QBF, Transformations into Normal Forms for Quantified Circuits, Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers, Deciding effectively propositional logic using DPLL and substitution sets, Validating QBF Validity in HOL4, Proving Valid Quantified Boolean Formulas in HOL Light, A self-adaptive multi-engine solver for quantified Boolean formulas, Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations, A Compact Representation for Syntactic Dependencies in QBFs, Unnamed Item, Unnamed Item, Bounded Model Checking with Parametric Data Structures, Compressing BMC Encodings with QBF