RAReQS
From MaRDI portal
Cited in
(72)- QuBE++
- QBFFam
- QRATPre+
- CEGAR
- Solving quantified linear arithmetic by counterexample-guided instantiation
- sQueezeBF
- PicoSAT
- Quaffle
- Lower bound techniques for QBF expansion
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- 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
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Solving dependency quantified Boolean formulas using quantifier localization
- Bloqqer
- Nenofex
- QUBOS
- QBFLIB
- DepQBF
- CalcCheck
- Combining resolution-path dependencies with dependency learning
- SOCRATES
- Refutation-based synthesis in SMT
- New models for generating hard random Boolean formulas and disjunctive logic programs
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- CirQit2
- QUBE
- Expansion-based QBF solving versus Q-resolution
- QMiraXT
- An approximation framework for solvers and decision procedures
- Conformant planning as a case study of incremental QBF solving
- Long-distance Q-resolution with dependency schemes
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models
- Quantified maximum satisfiability
- Incremental determinization
- Non-prenex QBF solving using abstraction
- Q-resolution with generalized axioms
- 2QBF: challenges and solutions
- Long distance Q-resolution with dependency schemes
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- HordeQBF
- MPIDepQBF
- Propositional SAT solving
- GRAPPA
- Encodings of bounded synthesis
- Lower bound techniques for QBF proof systems
- scientific article; zbMATH DE number 7228403 (Why is no real title available?)
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- QBFEVAL
- Acacia+
- CAQE
- AIGSolve
- Quantor
- semprop
- HQSpre
- AIGER
- Local redundancy in SAT: generalizations of blocked clauses
- Complexity-sensitive decision procedures for abstract argumentation
- scientific article; zbMATH DE number 7278086 (Why is no real title available?)
- Mjollnir
- sKizzo
- cnf2aig
- EPFL
- QESTO
- dCAQE
- Proof complexity of modal resolution
- Synchronous counting and computational algorithm design
- Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable
This page was built for software: RAReQS
