Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3185782780 / 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: Building strategies into QBF proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Quantified Horn Formulas: Models and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Stone in Pool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encodings of Bounded Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Determinization / 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: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal abstraction for DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank

Latest revision as of 09:50, 28 July 2024

scientific article
Language Label Description Also known as
English
Davis and Putnam meet Henkin: solving DQBF with resolution
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references