Polynomial-time computable stable models

We study the relations between the expressive power of non-monotonic formalisms and polynomial-time computability in the framework of stable models semantics. While the problem of deciding whether a logic program has a total stable model isNP-complete, we introduce a polynomial-time algorithm that generates such a model for several important classes of programs, that are discussed in this paper. In the general case, the algorithm generates a (not necessarily total)p-stable model of the input program.

[1]  Mihalis Yannakakis,et al.  Tie-breaking semantics and structural totality , 1992, PODS '92.

[2]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[3]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Carlo Zaniolo,et al.  Partial Models and Three-Valued Models in Logic Programs with Negation , 1991, LPNMR.

[5]  Luigi Palopoli,et al.  Reasoning with Minimal Models: Efficient Algorithms and Applications. , 1994, KR 1994.

[6]  John S. Schlipf,et al.  The expressive powers of the logic programming semantics (extended abstract) , 1990, PODS.

[7]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[8]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

[9]  Sergio Greco,et al.  Greedy by choice , 1992, PODS '92.

[10]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[11]  Carlo Zaniolo,et al.  Non-Determinism in Deductive Databases , 1991, DOOD.

[12]  John Lloyd,et al.  Foundation of logic programming , 1983 .

[13]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[14]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[15]  Jorge Lobo,et al.  On Constructive Negation for Disjunctive Logic Programs , 1990, NACLP.

[16]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[17]  Christine Froidevaux,et al.  General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..

[18]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[19]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[20]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[21]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[22]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[23]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[24]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[27]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[28]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[29]  Serge Abiteboul,et al.  Expressive Power of Query Languages , 1992, Theoretical Studies in Computer Science.

[30]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.