Expressiveness of semipositive logic programs with value invention

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1154, Issue , 1996, Pages 457-474

  Cabibbo, Luca ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING; PATENTS AND INVENTIONS; QUERY LANGUAGES; RECONFIGURABLE HARDWARE; SEMANTICS;

COMPUTABLE QUERY; DATALOG PROGRAMS; EXPRESSIVE POWER; FUNCTORS; LOGIC PROGRAMS; RELATIONAL QUERY LANGUAGES;

COMPUTER CIRCUITS;

EID: 33750076237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0031756     Document Type: Conference Paper

References (21)

1. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Science, 43(1):62-124, August 1991.
2. F. Afrati, S. Cosmadakis, and M. Yannakakis. On Datalog vs. polynomial time. In Tenth ACM SIGACT SIGMOD SIGART Syrup. on Principles of Database Systems, pages 13-25, 1991.
3. L. Cabibbo. On the power of stratified logic programs with value invention for expressing database transformations. In ICDT’95 (Fifth International Conference on Data Base Theory), Prague, Lecture Notes in Computer Science 893, pages 208-221, 1995.
4. L. Cabibbo. The expressive power of stratified logic programs with value invention. Technical Report n. RT-INF-11-1996, Dipartimento eli Discipfine Scientifiche, Università degli Studi di Roma Tre, 1996. Submitted to Information and Computation.
5. L. Cabibbo. Querying and Updating Complex-Object Databases. PhD thesis, Universits degli Studi di Roma "La Sapienza", 1996.
6. A.K. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Science, 21:333-347, 1980.
7. C.A. Gunter and D.S. Scott. Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 633-674. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
8. R. Hull and J. Su. Untyped sets, invention, and computable queries. In Eigth ACM SIGA CT SIGMOD SIGA RT Syrup. on Principles of Database Systems, pages 347-359, 1989.
9. R. Hull and J. Su. Algebraic and calculus query languages for recursively typed complex objects. Journal of Computer and System Science, 47(1):121-156, August 1993.
10. R. Hull and J. Su. Deductive query languages for recursively typed complex objects. Technical report, University of Southern California, 1993.
11. R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In Sixteenth International Conference on Very Large Data Bases, Brisbane, pages 455-468, 1990.
12. R. Hull and M. Yoshikawa. On the equivalence of database restructurings involving object identifiers. In Tenth ACM SIGACT SIGMOD SIGART Syrup. on Principles of Database Systems, pages 328-340, 1991.
13. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86-104, 1986.
14. P.O. Kolaitis. The expressive power of stratified logic programs. Information and Computation, 90(1):50-66, January 1991.
15. P.O. Kolaitis and M. Vardi. On the expressive power of Datalog: Tools and a case study. In Ninth ACM SIGACT SIGMOD SIGART Syrup. on Principles of Database Systems, pages 61-71, 1990.
16. G.M. Kuper and M.Y. Vardi. The logical data model. ACM Trans. on Database Syst., 18(3):379-413, September 1993.
17. D. Maier. A logic for objects. In Workshop on Foundations of Deductive Database and Logic Programming (Washington, D.C. 1986), pages 6-26, 1986.
18. C. Papadimitriou. A note on the expressive power of prolog. Bulletin of the EATCS, 26:21-23, 1985.
19. J. Van den Bussche. Formal Aspects of Object Identity in Database Manipulation. PhD thesis, University of Antwerp, 1993.
20. J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the completeness of object-creating query languages. In 33rd Annual Syrup. on Foundations of Computer Science, pages 372-379, 1992.
21. M. Vardi. The complexity of relational query languages. In Fourteenth ACM SIGACT Syrup. on Theory of Computing, pages 137-146, 1988.