Approximating the Stable Model Semantics is Hard

Authors:
Georg Gottlob;Mirosław Truszczyński
Affiliations:
Institut für Informationssysteme, Technische Universität Wien, Paniglgasse 16, 1040 Wien, Austria. gottlob@vexpert.dbai.tuwien.ac.at;Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046. mirek@cs.engr.uky.edu
Venue:
Fundamenta Informaticae
Year:
1996

Citing 8
Cited 0

Autoepistemic logic

Journal of the ACM (JACM)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete

Theoretical Computer Science
Reasoning with parsimonious and moderately grounded expansions

Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Complexity results for disjunctive logic programming and application to nonmonotonic logics

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
The expressive powers of the logic programming semantics

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Reasoning is Sometimes Simpler

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the complexity of problems concerned with approximating the stable model semantics. We show that under rather weak assumptions it is NP-hard to decide whether the size of a polynomially computable approximation is within a constant factor from the size of the intersection (union) of stable models of a program. We also show that unless P=NP, no approximation exists that uniformly bounds the intersection (union) of stable models.