swMATH46008MaRDI QIDQ5973448FDOQ5973448
Author name not available (Why is that?)
Official website: http://sat.inesc-id.pt/~mikolas/sw/areqs/
Cited In (72)
- Local redundancy in SAT: generalizations of blocked clauses
- Lower bound techniques for QBF expansion
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- Proof complexity of modal resolution
- Conformant planning as a case study of incremental QBF solving
- Quantified maximum satisfiability
- dCAQE
- Certified DQBF solving by definition extraction
- Hardness and optimality in QBF proof systems modulo NP
- 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
- Non-prenex QBF solving using abstraction
- Propositional SAT solving
- Refutation-based synthesis in SMT
- QESTO
- Solving dependency quantified Boolean formulas using quantifier localization
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Expansion-based QBF solving versus Q-resolution
- QuBE++
- CEGAR
- PicoSAT
- sQueezeBF
- Quaffle
- Bloqqer
- CalcCheck
- Nenofex
- DepQBF
- QBFLIB
- QUBOS
- SOCRATES
- CirQit2
- QUBE
- QMiraXT
- Synchronous counting and computational algorithm design
- Incremental determinization
- Proof complexity of symbolic QBF reasoning
- GRAPPA
- HordeQBF
- MPIDepQBF
- QBFEVAL
- Acacia+
- AIGSolve
- CAQE
- Quantor
- HQSpre
- semprop
- AIGER
- Complexity-sensitive decision procedures for abstract argumentation
- Title not available (Why is that?)
- Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- 2QBF: challenges and solutions
- Mjollnir
- cnf2aig
- EPFL
- sKizzo
- 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
- Encodings of bounded synthesis
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Lower bound techniques for QBF proof systems
- QBFFam
- QRATPre+
- Long-distance Q-resolution with dependency schemes
- 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
- Q-resolution with generalized axioms
- Long distance Q-resolution with dependency schemes
This page was built for software: RAReQS
