The Complexity of Circumscriptive Inference in Post’s Lattice

DOI10.1007/978-3-642-04238-6_25zbMath1258.68147OpenAlexW1536929732MaRDI QIDQ3643126

No author found.

Publication date: 10 November 2009

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04238-6_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logical aspects of Boolean algebras (03G05)

Related Items (4)

On the applicability of Post's lattice ⋮ The complexity of circumscriptive inference in Post's lattice ⋮ Trichotomies in the complexity of minimal inference ⋮ The Weight in Enumeration

This page was built for publication: The Complexity of Circumscriptive Inference in Post’s Lattice