A dichotomy in the complexity of propositional circumscription

DOI10.1007/s00224-004-1152-8zbMath1061.68075OpenAlexW2129495182MaRDI QIDQ1764422

Phokion G. Kolaitis, Lefteris M. Kirousis

Publication date: 24 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1152-8

zbMATH Keywords

inference problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60)

Related Items (3)

The complexity of circumscriptive inference in Post's lattice ⋮ Trichotomies in the complexity of minimal inference ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

This page was built for publication: A dichotomy in the complexity of propositional circumscription