Deterministic and Non-Deterministic Stable Models

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

[2]  G. Boolos,et al.  What is the name of this book? : the riddle of Dracula and other logical puzzles , 1979 .

[3]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[4]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[6]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[7]  Shamim A. Naqvi,et al.  Non-Deterministic Choice in Datalog , 1988, JCDKB.

[8]  Carlo Zaniolo,et al.  The LDL System Prototype , 1990, IEEE Trans. Knowl. Data Eng..

[9]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

[10]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[11]  Nicole Bidoit,et al.  Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..

[12]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[13]  Domenico Saccà.  Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems , 1996, Inf. Process. Lett..

[14]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

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

[16]  Letizia Tanca,et al.  Logic Programming and Databases , 1990, Surveys in Computer Science.

[17]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[18]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[19]  Zhi-Zhong Chen,et al.  The complexity of selecting maximal solutions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

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

[22]  Paolo Mancarella,et al.  Short Note: Preferred Extensions are Partial Stable Models , 1992, J. Log. Program..

[23]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[24]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[25]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

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

[27]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[28]  Serge Abiteboul,et al.  Non-deterministic languages to express deterministic transformations , 1990, PODS '90.

[29]  Carlo Zaniolo,et al.  Logic Programming Semantics Made Easy , 1992, ICALP.

[30]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[31]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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