Quantor
From MaRDI portal
Software:40095
swMATH28381MaRDI QIDQ40095FDOQ40095
Author name not available (Why is that?)
Cited In (21)
- Theory and Applications of Satisfiability Testing
- A Compact Representation for Syntactic Dependencies in QBFs
- Q-Resolution with Generalized Axioms
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Beyond CNF: A Circuit-Based QBF Solver
- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
- Dependency Schemes for DQBF
- Symbolic algorithmic verification of intransitive generalized noninterference
- Backdoor sets of quantified Boolean formulas
- Efficiently solving quantified bit-vector formulas
- Solving quantified constraint satisfaction problems
- Blocked Clause Elimination for QBF
- Ranking function synthesis for bit-vector relations
- Models and quantifier elimination for quantified Horn formulas
- Failed Literal Detection for QBF
- Preprocessing for DQBF
- A Unified Framework for Certificate and Compilation for QBF
- Solution validation and extraction for QBF preprocessing
- A solver for QBFs in negation normal form
- Incremental Determinization
This page was built for software: Quantor
