Computation of Stable Models and Its Integration with Logical Query Processing.

@article{DBLP:journals/tkde/ChenW96,
  author    = {Weidong Chen and
               David Scott Warren},
  title     = {Computation of Stable Models and Its Integration with Logical
               Query Processing},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {8},
  number    = {5},
  year      = {1996},
  pages     = {742-757},
  ee        = {db/journals/tkde/ChenW96.html, db/journals/tkde/ChenW96.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

CDROM Edition

References

[1]

Krzysztof R. Apt, Maarten H. van Emden: Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862(1982)

[2]

Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Implementing Stable Semantics by Linear Programming. LPNMR 1993: 23-42

[3]

Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases. J. ACM 41(6): 1178-1215(1994)

[4]

Nicole Bidoit, P. Legay: WELL!: An Evaluation Procedure for All Logic Programs. ICDT 1990: 335-348

[5]

Roland N. Bol, Lars Degerstedt: Tabulated Resolution for Well Founded Semantics. ILPS 1993: 199-219

[6]

...

[7]

Weidong Chen: Query Evaluation in Deductive Databases with Alternating Fixpoint Semantics. ACM Trans. Database Syst. 20(3): 239-287(1995)

[8]

Weidong Chen, David Scott Warren: A Goal-Oriented Approach to Computing the Well-Founded Semantics. J. Log. Program. 17(2/3&4): 279-300(1993)

[9]

Weidong Chen, David Scott Warren: Query Evaluation under the Well Founded Semantics. PODS 1993: 168-179

[10]

...

[11]

...

[12]

...

[13]

Phan Minh Dung: Negations as Hypotheses: An Abductive Foundation for Logic Programming. ICLP 1991: 3-17

[14]

Kave Eshghi: Computing Stable Models by Using the ATMS. AAAI 1990: 272-277

[15]

Kave Eshghi, Robert A. Kowalski: Abduction Compared with Negation by Failure. ICLP 1989: 234-254

[16]

Michael Gelfond: On Stratified Autoepistemic Theories. AAAI 1987: 207-211

[17]

Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080

[18]

Sergio Greco, Carlo Zaniolo, Sumit Ganguly: Greedy by Choice. PODS 1992: 105-113

[19]

Katsumi Inoue, Chiaki Sakama: Transforming Abductive Logic Programs to Disjunctive Programs. ICLP 1993: 335-353

[20]

Nicola Leone, Massimo Romeo, Pasquale Rullo, Domenico Saccà: Effective Implementation of Negation in Database Logic Query Languages. LOGIDATA+: Deductive Databases with Complex Objects 1993: 159-175

[21]

John W. Lloyd: Foundations of Logic Programming, 2nd Edition. Springer 1987, ISBN 3-540-18199-7

[22]

V. Wiktor Marek, Miroslaw Truszczynski: Autoepistemic Logic. J. ACM 38(3): 588-619(1991)

[23]

Shamim A. Naqvi, Shalom Tsur: A Logical Language for Data and Knowledge Bases. Computer Science Press 1989, ISBN 0-7167-8200-6

[24]

Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes: Derivation Procedures for Extended Stable Models. IJCAI 1991: 863-869

[25]

Stephen G. Pimentel, John L. Cuadrado: A Truth Maintenance System Based on Stable Models. NACLP 1989: 274-290

[26]

Teodor C. Przymusinski: Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. PODS 1989: 11-21

[27]

Teodor C. Przymusinski: The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundam. Inform. 13(4): 445-463(1990)

[28]

Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: Controlling the Search in Bottom-Up Evaluation. JICSLP 1992: 273-287

[29]

R. Ramesh, Weidong Chen: A Portable Method of Integrating SLG Resolution into Prolog Systems. SLP 1994: 618-632

[30]

Kenneth A. Ross: A Prodedural Semantics for Well-Founded Negation in Logic Programs. J. Log. Program. 13(1): 1-22(1992)

[31]

...

[32]

...

[33]

Domenico Saccà, Carlo Zaniolo: Stable Models and Non-Determinism in Logic Programs with Negation. PODS 1990: 205-217

[34]

...

[35]

Ken Satoh, Noboru Iwayama: A Query Evaluation Method for Abductive Logic Programming. JICSLP 1992: 671-685

[36]

John S. Schlipf: The Expressive Powers of the Logic Programming Semantics. PODS 1990: 196-204

[37]

...

[38]

Peter J. Stuckey, S. Sudarshan: Well-Founded Ordered Search (Extended Abstract). FSTTCS 1993: 161-172

[39]

V. S. Subrahmanian, Dana S. Nau, Carlo Vago: WFS + Branch and Bound = Stable Models. IEEE Trans. Knowl. Data Eng. 7(3): 362-377(1995)

[40]

Allen Van Gelder: The Alternating Fixpoint of Logic Programs with Negation. J. Comput. Syst. Sci. 47(1): 185-221(1993)

[41]

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650(1991)

[42]

Allen Van Gelder, Rodney W. Topor: Safety and Translation of Relational Calculus Queries. ACM Trans. Database Syst. 16(2): 235-278(1991)