semprop
From MaRDI portal
Software:40097
swMATH28383MaRDI QIDQ40097FDOQ40097
Author name not available (Why is that?)
Cited In (15)
- From QBFs to \textsf{MALL} and back via focussing
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- HordeQBF: A Modular and Massively Parallel QBF Solver
- Conformant planning as a case study of incremental QBF solving
- A Compact Representation for Syntactic Dependencies in QBFs
- Validating QBF Validity in HOL4
- Q-Resolution with Generalized Axioms
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- The complexity of pure literal elimination
- On deciding subsumption problems
- Computational methods for database repair by signed formulae
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- A solver for QBFs in negation normal form
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
This page was built for software: semprop
