Bloqqer

swMATH9578MaRDI QIDQ21559

No author found.

Described by source

• Blocked Clause Elimination for QBF

Related Items (31)

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Solution validation and extraction for QBF preprocessing ⋮ The QBF Gallery: behind the scenes ⋮ Quantifier reordering for QBF ⋮ Preprocessing for DQBF ⋮ Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ⋮ Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination ⋮ A Unified Proof System for QBF Preprocessing ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Recovering and Utilizing Partial Duality in QBF ⋮ Long-distance Q-resolution with dependency schemes ⋮ A game characterisation of tree-like Q-resolution size ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Truth Assignments as Conditional Autarkies ⋮ Encodings of Bounded Synthesis ⋮ Unnamed Item ⋮ Super-Blocked Clauses ⋮ Incremental Determinization ⋮ Q-Resolution with Generalized Axioms ⋮ 2QBF: Challenges and Solutions ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Extended Failed-Literal Preprocessing for Quantified Boolean Formulas ⋮ Solving QBF with Counterexample Guided Refinement ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ On QBF Proofs and Preprocessing ⋮ Solving QBF with counterexample guided refinement ⋮ SAT-Inspired Eliminations for Superposition

This page was built for software: Bloqqer