Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68178OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325863

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

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)

Related Items (5)

Transformations into Normal Forms for Quantified Circuits ⋮ Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers ⋮ A solver for QBFs in negation normal form ⋮ A Compact Representation for Syntactic Dependencies in QBFs ⋮ Encoding deductive argumentation in quantified Boolean formulae

Uses Software

• Quaffle
• QUBOS
• Python

This page was built for publication: Theory and Applications of Satisfiability Testing