Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/programming-with-non-determinism-in-deductive-databases-00OIzafO0w
References (51)
-
S. Abiteboul, R. Hull, V. Vianu (1994)
Foundations of Databases -
D. Saccá, C. Zaniolo (1990)
Stable models and non-determinism in logic programs with negation -
(1996)
Semantics and Expressive Power of Non- Deterministic Constructs in Deductive -
Phokion Kolaitis, C. Papadimitriou (1988)
Why not negation by fixpoint?J. Comput. Syst. Sci., 43
-
Alan Gelser (1989)
Negation as failure using tight derivations for general logic programsJournal of Logic Programming, 6
-
S. Greco, D. Saccá, C. Zaniolo (1995)
DATALOG Queries with Stratified Negation and Choice: from P to DP -
M. Gelfond, Vladimir Lifschitz (1988)
The Stable Model Semantics for Logic Programming -
E-mail: zaniolo@cs.ucla -
David Johnson (1991)
A Catalog of Complexity Classes -
J. Ullman (1988)
Principles of database and knowledge-base systems, Vol. I, 14
-
A. Gelder, K. Ross, J. Schlipf (1991)
The well-founded semantics for general logic programsJ. ACM, 38
-
Phokion Kolaitis, Moshe Vardi (1990)
On the expressive power of datalog: tools and a case studyJ. Comput. Syst. Sci., 51
-
K. Apt, H. Blair, A. Walker (1988)
Towards a Theory of Declarative Knowledge -
P. Kolaitis (1990)
The expressive power of stratified logic programsInformation and Computation, 90
-
J. Ullman (1979)
Principles Of Database And Knowledge-Base Systems -
A. Chandra, D. Harel (1985)
Horn Clauses Queries and GeneralizationsJ. Log. Program., 2
-
S. Abiteboul, E. Simon, V. Vianu (1990)
Non-deterministic languages to express deterministic transformations -
Luca Corciulo, F. Giannotti, D. Pedreschi (1993)
Datalog with Non-Deterministic Choice Computes NDB-PTIME -
D. Saccá, C. Zaniolo (1997)
Deterministic and Non-Deterministic Stable ModelsJ. Log. Comput., 7
-
F. Giannotti, D. Pedreschi, C. Zaniolo (1990)
Declarative Semantics for Pruning Operators in Logic Programming -
J. Beidler (1997)
Data Structures and Algorithms -
C. Zaniolo, Natraj Arni, K. Ong (1993)
Negation and Aggregates in Recursive Rules: the LDL++ Approach -
A. Chandra, D. Harel (1985)
Horn clause and generalizationsJournal of Logic Programming, 2
-
Keywords: Deductive databases, logic{based languages, non-determinism, expressive power, procedural semantics, declarative semantics, xpoint -
F. Afrati, S. Cosmadakis, M. Yannakakis (1995)
On Datalog vs. Polynomial TimeJ. Comput. Syst. Sci., 51
-
A. Chandra, D. Harel (1980)
Computable Queries for Relational Data BasesJ. Comput. Syst. Sci., 21
-
M. Baudinet, J. Chomicki, P. Wolper (1993)
Temporal Deductive Databases -
Antonio Brogi, V. Subrahmanian, C. Zaniolo (2004)
The logic of totally and partially ordered plans: a deductive database approachAnnals of Mathematics and Artificial Intelligence, 19
-
S. Debray, D. Warren (1990)
Towards Banishing the Cut from PrologIEEE Trans. Software Eng., 16
-
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.) -
F. Giannotti, D. Pedreschi (1998)
Datalog with Non-Deterministic Choice Computers NDB-PTIMEJ. Log. Program., 35
-
R. Ramakrishnan, D. Srivastava, S. Sudarshan (1992)
CORAL - Control, Relations and Logic -
N. Immerman (1987)
Languages that Capture Complexity ClassesSIAM J. Comput., 16
-
Luca Corciulo, F. Giannotti, D. Pedreschi, C. Zaniolo (1994)
Expressive Power of Non-Deterministic Operators for Logic-based Languages -
C. Papadimitriou (1985)
A note the expressive power of PrologBull. EATCS, 26
-
Phokion Kolaitis (1991)
The Expressive Power of Stratified ProgramsInf. Comput., 90
-
R. Krishnamurthy, S. Naqvi (1988)
Non-Deterministic Choice in Datalog -
Weidong Chen, Jiang Zeng (1996)
Nondeterminism Through Well-Founded ChoiceJ. Log. Program., 26
-
Yeh-Heng Sheng (1991)
A non-deterministic deductive database language -
Moshe Vardi (1982)
The complexity of relational query languages (Extended Abstract) -
S. Naqvi, S. Tsur (1989)
A Logical Language for Data and Knowledge Bases -
F. Giannotti, D. Pedreschi, D. Saccá, C. Zaniolo (1991)
Non-Determinism in Deductive Databases -
S. Abiteboul, V. Vianu (1991)
Datalog Extensions for Database Queries and UpdatesJ. Comput. Syst. Sci., 43
-
J. Schlipf (1992)
A Survey of Complexity and Undecidability Results in Logic Programming -
Sumit Ganguly, S. Greco, C. Zaniolo (1995)
Extrema Predicates in Deductive DatabasesJ. Comput. Syst. Sci., 51
-
J. Schlipf (1990)
The expressive powers of the logic programming semantics (extended abstract) -
J. Lloyd (1984)
Foundations of Logic Programming -
A. Chandra, D. Harel (1982)
Structures and complexity of relational queriesJournal of Computer and System Science, 25
-
A. Chandra, D. Harel (1980)
Structure and complexity of relational queries21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
-
S. Greco, C. Zaniolo, Sumit Ganguly (1992)
Greedy by choice -
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
- Publisher
- Springer Journals
- Copyright
- Copyright © 1997 by Kluwer Academic Publishers
- Subject
- Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1018999404360
- Publisher site
- See Article on Publisher Site
Abstract
While non-determinism has long been established as a key concept in logic pro-gramming, its importance in the context of deductive databases was recognized only recently. This paper provides an overview of recent results on this topic with the aim of providing an introduction to the theory and practice of non-determinism in deductive databases. In particular we (i) recall the main results linking non-deterministic constructs in database languages to the theory of data complexity and the expressibility hierarchy of query languages; (ii) provide a reasoned introduction to effective programming with non-deterministic constructs; (iii) compare the usage of non-deterministic constructs in languages such as LDL++ to that of traditional logic programming languages; (iv) discuss the link between the semantics of logic programs with non-deterministic constructs and the stable-model semantics of logic programs with negation.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 15, 2004