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
• Feasible Interpolation for QBF Resolution Calculi
• Lower Bound Techniques for QBF Proof Systems
• 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
• Title not available (Why is that?)
• HordeQBF: A Modular and Massively Parallel QBF Solver
• Quantified maximum satisfiability
• A Compact Representation for Syntactic Dependencies in QBFs
• Lower bounds for QCDCL via formula gauge
• Title not available (Why is that?)
• Automated Testing and Debugging of SAT and QBF Solvers
• Integrating Dependency Schemes in Search-Based QBF Solvers
• Title not available (Why is that?)
• Long Distance Q-Resolution with Dependency Schemes
• Q-Resolution with Generalized Axioms
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
• Correct Hardware Design and Verification Methods
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Inconsistency Tolerance
• Building strategies into QBF proofs
• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• Principles and Practice of Constraint Programming – CP 2003
• A game characterisation of tree-like Q-resolution size
• sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
• Expansion-based QBF solving versus Q-resolution
• Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
• Unified QBF certification and its applications
• Proof complexity of symbolic QBF reasoning
• Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
• Lifting QBF Resolution Calculi to DQBF
• SAT-Solving Based on Boundary Point Elimination
• Deciding Boolean algebra with Presburger arithmetic
• Theory and Applications of Satisfiability Testing
• A simple proof of QBF hardness
• Using SAT in QBF
• Bounded Universal Expansion for Preprocessing QBF
• On Q-Resolution and CDCL QBF Solving
• On Stronger Calculi for QBFs
• From (Quantified) Boolean Formulae to Answer Set Programming
• 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
• Evaluating and certifying QBFs: A comparison of state-of-the-art tools
• Title not available (Why is that?)
• An effective algorithm for the futile questioning problem
• A Non-prenex, Non-clausal QBF Solver with Game-State Learning
• QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

This page was built for software: Quaffle