RAReQS
From MaRDI portal
Software:5973448
No author found.
Related Items (38)
Quantified maximum satisfiability ⋮ Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ An approximation framework for solvers and decision procedures ⋮ The QBF Gallery: behind the scenes ⋮ Proof complexity of modal resolution ⋮ QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ⋮ Propositional SAT Solving ⋮ Unnamed Item ⋮ Solving dependency quantified Boolean formulas using quantifier localization ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Lower Bound Techniques for QBF Proof Systems ⋮ Combining resolution-path dependencies with dependency learning ⋮ Long-distance Q-resolution with dependency schemes ⋮ Solving quantified linear arithmetic by counterexample-guided instantiation ⋮ Synchronous counting and computational algorithm design ⋮ Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models ⋮ Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Encodings of Bounded Synthesis ⋮ Lower bound techniques for QBF expansion ⋮ Unnamed Item ⋮ Refutation-based synthesis in SMT ⋮ New models for generating hard random Boolean formulas and disjunctive logic programs ⋮ Incremental Determinization ⋮ Non-prenex QBF Solving Using Abstraction ⋮ Q-Resolution with Generalized Axioms ⋮ 2QBF: Challenges and Solutions ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ Unnamed Item ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ Solving QBF with Counterexample Guided Refinement ⋮ Expansion-based QBF solving versus Q-resolution ⋮ QBFFam: a tool for generating QBF families from proof complexity ⋮ Hardness and optimality in QBF proof systems modulo NP ⋮ Proof complexity of symbolic QBF reasoning ⋮ Certified DQBF solving by definition extraction
This page was built for software: RAReQS
