Expansion-based QBF solving versus Q-resolution (Q2339467): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62047279, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sequent Systems and Resolution for QBFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nenofex: Expanding NNF for QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Universal Expansion for Preprocessing QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3566747 / 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: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3436752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear reasoning. A new form of the Herbrand-Gentzen theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davis-Putnam resolution versus unrestricted resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings / rank
 
Normal rank

Revision as of 21:57, 9 July 2024

scientific article
Language Label Description Also known as
English
Expansion-based QBF solving versus Q-resolution
scientific article

    Statements

    Expansion-based QBF solving versus Q-resolution (English)
    0 references
    0 references
    0 references
    1 April 2015
    0 references
    quantified Boolean formula
    0 references
    proof theory
    0 references
    expansion
    0 references
    Q-resolution
    0 references
    SAT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers