Solving dependency quantified Boolean formulas using quantifier localization (Q2148900): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DepQBF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: iProver / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QESTO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HQSpre / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3128044797 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113863159 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1905.04755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as satisfiability: parallel plans and algorithms for plan search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread-parallel integrated test pattern generator utilizing satisfiability analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient SAT-based bounded model checking for software verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for multiplayer noncooperative games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Henkin quantifiers and Boolean formulae: a certification perspective of DQBF / 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: Q5732647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: From DQBF to QBF by dependency elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal abstraction for DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: DQBDD: an efficient BDD-based DQBF solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resolution-style proof system for DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier Elimination via Functional Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skolem functions for DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast DQBF Refutation / rank
 
Normal rank

Latest revision as of 11:27, 29 July 2024

scientific article
Language Label Description Also known as
English
Solving dependency quantified Boolean formulas using quantifier localization
scientific article

    Statements

    Solving dependency quantified Boolean formulas using quantifier localization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2022
    0 references
    0 references
    dependency quantified Boolean formulas
    0 references
    Henkin quantifier
    0 references
    quantifier localization
    0 references
    satisfiability
    0 references
    solver technology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references