Quaffle

swMATH7278MaRDI QIDQ19323FDOQ19323

Author name not available (Why is that?)

Cited In (62)

• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Theory and Applications of Satisfiability Testing
• A First Step Towards a Unified Proof Checker for QBF
• Solving QBF with counterexample guided refinement
• The QBF Gallery: behind the scenes
• Theory and Applications of Satisfiability Testing
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Quantified maximum satisfiability
• A Compact Representation for Syntactic Dependencies in QBFs
• Lower bounds for QCDCL via formula gauge
• Title not available (Why is that?)
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Feasible interpolation for QBF resolution calculi
• Theory and Applications of Satisfiability Testing
• A non-prenex, non-clausal QBF solver with game-state learning
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Lifting QBF resolution calculi to DQBF
• Inconsistency Tolerance
• Building strategies into QBF proofs
• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• A game characterisation of tree-like Q-resolution size
• An empirical study of QBF encodings: from treewidth estimation to useful preprocessing
• Expansion-based QBF solving versus Q-resolution
• Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
• On Q-resolution and CDCL QBF solving
• Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
• Unified QBF certification and its applications
• Convergence testing in term-level bounded model checking
• Evaluating and certifying QBFs: a comparison of state-of-the-art tools
• Proof complexity of symbolic QBF reasoning
• Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
• Automated testing and debugging of SAT and QBF solvers
• Integrating dependency schemes in search-based QBF solvers
• Efficiently representing existential dependency sets for expansion-based QBF solvers
• Deciding Boolean algebra with Presburger arithmetic
• QELL: QBF reasoning with extended clause learning and levelized SAT solving
• Using stochastic local search to solve quantified Boolean formulae
• Theory and Applications of Satisfiability Testing
• Feasible interpolation for QBF resolution calculi
• A simple proof of QBF hardness
• Using SAT in QBF
• Bounded Universal Expansion for Preprocessing QBF
• On Stronger Calculi for QBFs
• From (Quantified) Boolean Formulae to Answer Set Programming
• Lower bound techniques for QBF proof systems
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• A solver for QBFs in negation normal form
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Model Checking Software
• Computer Aided Verification
• Long-distance Q-resolution with dependency schemes
• sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
• HordeQBF: a modular and massively parallel QBF solver
• SAT-solving based on boundary point elimination
• An effective algorithm for the futile questioning problem
• Q-resolution with generalized axioms
• Long distance Q-resolution with dependency schemes

This page was built for software: Quaffle