Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.tcs.2013.12.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102022086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Henkin Quantifiers and Boolean Formulae / 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: Henkin quantifiers and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / 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: Q3566747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence and quantifier rules for logic with imperfect information / 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: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4732440 / 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: The polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 07:25, 7 July 2024

scientific article
Language Label Description Also known as
English
Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
scientific article

    Statements

    Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (English)
    0 references
    0 references
    0 references
    4 February 2014
    0 references
    Henkin quantifier
    0 references
    quantified Boolean formula
    0 references
    Herbrand function
    0 references
    Skolem function
    0 references
    resolution
    0 references
    consensus
    0 references

    Identifiers