QUBOS

swMATH9580MaRDI QIDQ21561

No author found.

Related Items (23)

Backdoors to Normality for Disjunctive Logic Programs ⋮ Solution validation and extraction for QBF preprocessing ⋮ Unnamed Item ⋮ Theory and Applications of Satisfiability Testing ⋮ Nenofex: Expanding NNF for QBF Solving ⋮ Quantifier elimination by dependency sequents ⋮ Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers ⋮ Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN ⋮ Computational methods for database repair by signed formulae ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ A First Step Towards a Unified Proof Checker for QBF ⋮ Bounded Universal Expansion for Preprocessing QBF ⋮ Q-Resolution with Generalized Axioms ⋮ A solver for QBFs in negation normal form ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ A Compact Representation for Syntactic Dependencies in QBFs ⋮ From (Quantified) Boolean Formulae to Answer Set Programming ⋮ Symbolic and Quantitative Approaches to Reasoning with Uncertainty ⋮ Backdoor sets of quantified Boolean formulas ⋮ Solving QBF with Counterexample Guided Refinement ⋮ Expansion-based QBF solving versus Q-resolution ⋮ Unnamed Item ⋮ Solving QBF with counterexample guided refinement

This page was built for software: QUBOS