ACM SIGMOD Anthology TODS dblp.uni-trier.de

Query Evaluation in Deductive Databases with Alternating Fixpoint Semantics.

Weidong Chen: Query Evaluation in Deductive Databases with Alternating Fixpoint Semantics. ACM Trans. Database Syst. 20(3): 239-287(1995)
@article{DBLP:journals/tods/Chen95a,
  author    = {Weidong Chen},
  title     = {Query Evaluation in Deductive Databases with Alternating Fixpoint
               Semantics},
  journal   = {ACM Trans. Database Syst.},
  volume    = {20},
  number    = {3},
  year      = {1995},
  pages     = {239-287},
  ee        = {http://doi.acm.org/10.1145/211414.211416, db/journals/tods/Chen95a.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

First-order formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the well-founded semantics of normal logic programs to general logic programs with arbitrary first-order formulas in rule bodies. However, an implementation of general logic programs through the standard translation into normal logic programs does not preserve the alternating fixpoint semantics. This paper presents a direct method for goal-oriented query evaluation of general logic programs. Every general logic program is first transformed into a normal form where the body of each rule is either an existential conjunction of literals or a universal disjunction of literals. Techniques of memoing and loop checking are incorporated so that termination and polynomial-time data complexity are guaranteed for deductive databases (or function-free programs). Results of the soundness and search space completeness are established.

Copyright © 1995 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 2, TODS 1991-1995, TKDE 1989-1992" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

Online Edition: ACM Digital Library

[Abstract, Index Terms and Review]
[Full Text in PDF Format, 2998 KB]

References

[Aiken et al. 1992]
Alexander Aiken, Jennifer Widom, Joseph M. Hellerstein: Behavior of Database Production Rules: Termination, Confluence, and Observable Determinism. SIGMOD Conference 1992: 59-68 BibTeX
[Apt and van Emden 1982]
Krzysztof R. Apt, Maarten H. van Emden: Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862(1982) BibTeX
[Chen and Warren 1993a]
Weidong Chen, David Scott Warren: Query Evaluation under the Well Founded Semantics. PODS 1993: 168-179 BibTeX
[Chen and Warren 1993b]
...
[Chen and Warren 1995]
Weidong Chen, David Scott Warren: Tabled Evaluation With Delaying for General Logic Programs. J. ACM 43(1): 20-74(1996) BibTeX
[Chen et al. 1995]
Weidong Chen, Terrance Swift, David Scott Warren: Efficient Top-Down Computation of Queries under the Well-Founded Semantics. J. Log. Program. 24(3): 161-199(1995) BibTeX
[Gelfond and Lifschitz 1988]
Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080 BibTeX
[Lloyd 1987]
John W. Lloyd: Foundations of Logic Programming, 2nd Edition. Springer 1987, ISBN 3-540-18199-7
BibTeX
[Lloyd and Topor 1984]
John W. Lloyd, Rodney W. Topor: Making Prolog more Expressive. J. Log. Program. 1(3): 225-240(1984) BibTeX
[Lloyd and Topor 1985]
John W. Lloyd, Rodney W. Topor: A Basis for Deductive Database Systems. J. Log. Program. 2(2): 93-109(1985) BibTeX
[Lloyd and Topor 1986]
John W. Lloyd, Rodney W. Topor: A Basis for Deductive Database Systems II. J. Log. Program. 3(1): 55-67(1986) BibTeX
[Moschovakis 1974]
...
[Pereira et al. 1991]
...
[Przymusinski 1988]
Teodor C. Przymusinski: On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216 BibTeX
[Ramakrishnan et al. 1992]
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: Controlling the Search in Bottom-Up Evaluation. JICSLP 1992: 273-287 BibTeX
[Ramesh and Chen 1994]
R. Ramesh, Weidong Chen: A Portable Method of Integrating SLG Resolution into Prolog Systems. SLP 1994: 618-632 BibTeX
[Sagonas et al. 1994]
Konstantinos F. Sagonas, Terrance Swift, David Scott Warren: XSB as an Efficient Deductive Database Engine. SIGMOD Conference 1994: 442-453 BibTeX
[Stuckey and Sudarshan 1993]
Peter J. Stuckey, S. Sudarshan: Well-Founded Ordered Search (Extended Abstract). FSTTCS 1993: 161-172 BibTeX
[Van Gelder 1993]
Allen Van Gelder: The Alternating Fixpoint of Logic Programs with Negation. J. Comput. Syst. Sci. 47(1): 185-221(1993) BibTeX
[Van Gelder et al. 1991]
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650(1991) BibTeX
[Van Gelder and Topor 1991]
Allen Van Gelder, Rodney W. Topor: Safety and Translation of Relational Calculus Queries. ACM Trans. Database Syst. 16(2): 235-278(1991) BibTeX
[Vardi 1982]
Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146 BibTeX

Referenced by

  1. Weidong Chen: Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning. IEEE Trans. Knowl. Data Eng. 9(4): 587-599(1997)
  2. Jörg Flum, Max Kubierschky, Bertram Ludäscher: Total and Partial Well-Founded Datalog Coincide. ICDT 1997: 113-124
  3. Weidong Chen, David Scott Warren: Computation of Stable Models and Its Integration with Logical Query Processing. IEEE Trans. Knowl. Data Eng. 8(5): 742-757(1996)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:39:18 2008