QUBOS

swMATH9580MaRDI QIDQ21561FDOQ21561

Author name not available (Why is that?)

Official website: http://link.springer.com/chapter/10.1007/3-540-36126-X_12

Cited In (29)

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

This page was built for software: QUBOS