Proof complexity of symbolic QBF reasoning (Q2118330): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184676641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Resolution Systems and Their Proof Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound techniques for QBF expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frege Systems for Quantified Boolean Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Resolution-Based QBF Calculi and Their Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4988300 / 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: Q5111890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth in Verification: Local vs. Global / 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: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with counterexample guided refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Learning for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive multi-engine solver for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-prenex QBF Solving Using Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Latest revision as of 09:51, 28 July 2024

scientific article
Language Label Description Also known as
English
Proof complexity of symbolic QBF reasoning
scientific article

    Statements

    Proof complexity of symbolic QBF reasoning (English)
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references