Trichotomies in the complexity of minimal inference (Q692908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bases for Boolean co-clones / 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: The complexity of propositional closed world reasoning and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selecting maximal solutions / 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: Characterizing diagnoses and systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between circumscription and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Enumeration Problems for Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimal satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy in the complexity of propositional circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / 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: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4662458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebras of partial functions and their invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Polymorphisms and Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Circumscriptive Inference in Post’s Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904137 / rank
 
Normal rank

Latest revision as of 23:50, 5 July 2024

scientific article
Language Label Description Also known as
English
Trichotomies in the complexity of minimal inference
scientific article

    Statements

    Trichotomies in the complexity of minimal inference (English)
    0 references
    0 references
    0 references
    0 references
    6 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references