Sergio Greco, Domenico Sacca, Carlo Zaniolo  Home/Search
Context Related
| ucla.edu/~zaniolo/papers/icdt95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/~zaniolo...ZanioloPapers (more) Homepages: C.Zaniolo |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a unified solution to the problem of extending stratified DATALOG to express DB-complexity classes ranging from P to D^P. The solution... (Update)
Context of citations to this paper: More
...pairs with the same first component C , has a non deterministic update interpretation. Note that non deterministic choice [GSZ95, Sha89] is not involved at the level of the logical semantics. However, an implementation has to perform a choice operation when...
.... several proposals for language constructs specifying nondeterministic queries that are related to our approach (witness [1] choice [36, 37, 41]) Essentially, the idea is to construct a maximal subset of a given relation that satisfies a given set of functional dependencies....
Cited by: More
A Logical Framework for the Specification of Transactions - Extended Version.. (Correct)
Logics for Emerging Applications of Databases - Chomicki, Saake, van der Meyden (2003) (Correct)
Extending Stratified Datalog to Capture Complexity Classes .. - Greco, Sacch, Zaniolo (2001) (Correct)
Active bibliography (related documents): More All
0.5: Looking for an Analogue of Rice's Theorem in Circuit.. - Borchert, Stephan (2000) (Correct)
0.4: Programming with Non-determinism in Deductive Databases - Giannotti, Greco.. (1997) (Correct)
0.3: Expressive Power and Complexity of Partial Models for.. - Eiter, Leone.. (1998) (Correct)
Similar documents based on text: More All
0.7: Stratified Resolution - Degtyarev, Voronkov (2000) (Correct)
0.7: Grammars And Automata To Optimize Chain Logic Queries - Greco, Sacca (1999) (Correct)
0.6: The PushDown Method to Optimize Chain Logic Programs (Extended.. - Greco, al. (Correct)
Related documents from co-citation: More All
8: Foundations of databases (context) - Abiteboul, Hull et al. - 1995
7: Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
7: The complexity of relational query languages (context) - Vardi - 1982
BibTeX entry: (Update)
S. Greco, D. Sacc`a and C. Zaniolo. DATALOG Queries with Stratified Negation and Choice: from P to D p . In Proc. of the Int. Conf. on Database Theory, LNCS n. 893, Springer-Verlag, 1995, pp.82-96. http://citeseer.ist.psu.edu/greco95datalog.html More
@inproceedings{ greco95datalog,
author = "Sergio Greco and Domenico Sacca and Carlo Zaniolo",
title = "{DATALOG} Queries with Stratified Negation and Choice: from P to D P ",
booktitle = "{ICDT}",
pages = "82--96",
year = "1995",
url = "citeseer.ist.psu.edu/greco95datalog.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
981 Principles of Databases and Knowledge Base Systems (context) - Ullman - 1988
951 Computational Complexity (context) - Papadimitriou - 1994
858 The stable model semantics of logic programming - Gelfond, Lifschitz - 1988
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
274 A Catalog of Complexity Classes (context) - Johnson - 1990
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
211 Languages that Capture Complexity Classes - Immerman - 1987
210 Generalized First-Order Spectra and Polynomial-Time Recogniz.. (context) - Fagin - 1974
198 Structures and Complexity of Relational Queries - Chandra, Harel - 1982
151 Autoepistemic Logic (context) - Marek, Truszczynski - 1991
124 Datalog Extensions for Databases Queries and Updates (context) - Abiteboul, Vianu - 1991
113 Relations and Logic (context) - Ramakrisnhan, Srivastava et al. - 1992
68 Stable models and non-determinism in logic programs with neg.. - Sacc, Zaniolo - 1990
61 The expressive power of the logic programming semantics (context) - Schlipf - 1990
42 Non-Deterministic Language to Express Deterministic Transfor.. (context) - Abiteboul, Simon et al. - 1990
39 and Some Facets of Complexity (context) - Papadimitriou, Yannakakis et al. - 1982
31 Nondeterminism in deductive databases - Giannotti, Pedreschi et al. - 1991
28 Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1989
24 A Note on the Expressive Power of Prolog (context) - Papadimitriou - 1985
21 A logic language for data and knowledge bases (context) - Naqvi, Tsur - 1989
18 A Survey of Complexity and Undecidability Results in Logic P.. (context) - Schlipf - 1993
14 Polynomial Time (context) - Afrati, Cosmadakis et al. - 1991
12 Greedy by Choice - Greco, Zaniolo et al. - 1992
7 Horn clause and generalizations (context) - Chandra, Harel - 1985
5 The Expressive Power of Stratied Logic Programs (context) - Kolaitis - 1990
5 Why not negation by xpoint (context) - Kolaitis, Papadimitriou - 1991
2 the unique satisability problem (context) - Blass, Gurevich - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucla.edu/~zaniolo/papers/ZanioloPapers.html): More
Metaqueries for Data Mining - Shen, Ong, Mitbander, Zaniolo (1996) (Correct)
Greedy Algorithms in Datalog with Choice and Negation - Greco, Zaniolo (1998) (Correct)
Negation and Aggregates in Recursive Rules: the LDL++ Approach - Zaniolo, Arni, Ong (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC