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