A solver for QBFs in negation normal form (Q1020501): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: semprop / 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/s10601-008-9055-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161955489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Preferential Paraconsistent Reasoning to Classical Entailment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inconsistency Tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality result for clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On different structure-preserving translations to normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of nested counterfactuals and iterated knowledge base revisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and knowledge representation---The A-Prolog perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterfactuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backjumping for quantified Boolean logic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Clause Reasoning in QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / rank
 
Normal rank

Latest revision as of 15:18, 1 July 2024

scientific article
Language Label Description Also known as
English
A solver for QBFs in negation normal form
scientific article

    Statements

    A solver for QBFs in negation normal form (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2009
    0 references
    0 references
    solver
    0 references
    QBFs
    0 references
    negation normal form
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references