Theory and Applications of Satisfiability Testing
DOI10.1007/B95238zbMATH Open1204.68178OpenAlexW2494235144MaRDI QIDQ5325863FDOQ5325863
Uwe Egly, Stefan Woltran, Hans Tompits, Martina Seidl, Michael Zolda
Publication date: 24 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95238
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)
Cited In (6)
- Transformations into Normal Forms for Quantified Circuits
- A Compact Representation for Syntactic Dependencies in QBFs
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
- A solver for QBFs in negation normal form
- Encoding deductive argumentation in quantified Boolean formulae
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Contributions to the Theory of Practical Quantified Boolean Formula Solving 👍 👎
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas 👍 👎
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation 👍 👎
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation 👍 👎
- Theory and Applications of Satisfiability Testing 👍 👎
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications 👍 👎
- Preprocessing Boolean Formulae for BDDs in a Probabilistic Context 👍 👎
- New approaches to boolean quantifier elimination 👍 👎
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325863)
