Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Characterizations of the disjunctive stable semantics by partial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure in the head / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Default Logic on Generalized Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional closed world reasoning and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of model checking for circumscriptive formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes propositional abduction tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:14, 5 July 2024

scientific article
Language Label Description Also known as
English
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
scientific article

    Statements

    Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (English)
    0 references
    24 May 2012
    0 references
    0 references
    answer sets
    0 references
    supported models
    0 references
    complexity of reasoning
    0 references