Cited in
(40)- Theory and Applications of Satisfiability Testing
- A Unified Framework for Certificate and Compilation for QBF
- Solution validation and extraction for QBF preprocessing
- Computational methods for database repair by signed formulae
- scientific article; zbMATH DE number 1979551 (Why is no real title available?)
- RAReQS
- Expansion-based QBF solving versus Q-resolution
- A First Step Towards a Unified Proof Checker for QBF
- From (Quantified) Boolean Formulae to Answer Set Programming
- Backdoors to normality for disjunctive logic programs
- QESTO
- A solver for QBFs in negation normal form
- Nenofex: Expanding NNF for QBF Solving
- Backdoor sets of quantified Boolean formulas
- Q-resolution with generalized axioms
- Integrity checking and maintenance in relational and deductive databases and beyond
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- QuBE++
- sQueezeBF
- Quaffle
- A Compact Representation for Syntactic Dependencies in QBFs
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Bloqqer
- Nenofex
- DepQBF
- SATORI
- CirQit2
- QUBE
- Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
- Solving QBF with counterexample guided refinement
- CAQE
- Quantor
- semprop
- KoMeT
- Solving QBF with counterexample guided refinement
- sKizzo
- QRATPre+
- Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
- Bounded Universal Expansion for Preprocessing QBF
- Quantifier elimination by dependency sequents
This page was built for software: QUBOS
