Trichotomies in the complexity of minimal inference
type: Item
instance of: scholarly article
title: Trichotomies in the complexity of minimal inference
zbMATH Open document ID: 1290.68057
author: Arnaud Durand
author: Miki Hermann
author: Gustav Nordh
published in: Theory of Computing Systems
publication date: 2012-12-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6113533
MaRDI profile type: Publication
full work available at URL: s00224-011-9320-0
OpenAlex ID: W2168335621
cites work: Bases for Boolean co-clones
cites work: The complexity of model checking for circumscriptive formulae
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: The complexity of selecting maximal solutions
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Characterizing diagnoses and systems
cites work: Q4418672
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Closed systems of functions and predicates
cites work: On the relationship between circumscription and negation as failure
cites work: Closure properties of constraints
cites work: On the Complexity of Some Enumeration Problems for Matroids
cites work: Q4799291
cites work: The complexity of minimal satisfiability problems
cites work: A dichotomy in the complexity of propositional circumscription
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Q4354427
cites work: Q4662458
cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
cites work: Graph minors. XIII: The disjoint paths problem
cites work: The algebras of partial functions and their invariants
cites work: The complexity of satisfiability problems
cites work: Partial Polymorphisms and Constraint Satisfaction Problems
cites work: The Complexity of Circumscriptive Inference in Post’s Lattice
cites work: Q4904137
DOI: 10.1007/S00224-011-9320-0
description: scientific article; zbMATH DE number 6113533