Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QRATPre+ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bloqqer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QUBOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RAReQS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CAQE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sQueezeBF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: semprop / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DepQBF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10703-021-00371-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3195087575 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113902759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2QBF: Challenges and Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT race 2015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unification of QBF Resolution-Based Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocked Clause Elimination for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Synthesis Methods for Safety Specs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable-unstable semantics: Beyond NP with normal logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Universal Expansion for Preprocessing QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Synthesis for GXW Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided abstraction refinement for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning as a case study of incremental QBF solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encodings of Bounded Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Unrealizability of Distributed Fault-tolerant Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause Elimination for SAT and QSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominant Controllability Check Using QBF-Solver and Netlist Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with counterexample guided refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Propositional QBF Expansions and Q-Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF solving versus Q-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-prenex, Non-clausal QBF Solver with Game-State Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL / rank
 
Normal rank
Property / cites work
 
Property / cites work: QRATPre+: effective QBF preprocessing via strong redundancy properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency learning for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-prenex QBF Solving Using Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansion and resolution in CEGAR based QBF solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Encoding of Temporal Properties and QBF-Based Verification / rank
 
Normal rank

Latest revision as of 11:11, 27 July 2024

scientific article
Language Label Description Also known as
English
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
scientific article

    Statements

    Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    quantified Boolean formulas
    0 references
    decision procedures
    0 references
    CEGAR
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers