Expressiveness of Semipositive Logic Programs with Value Invention

We study the expressive power of the relational query language WILOG1/2,⌝ of semipositive datalog programs extended with a mechanism of safe value invention. We adopt a semantics for value invention based on the use of Skolem functor terms. We show that this language expresses exactly the class of semimonotone queries, that is, the class of computable queries that are preserved under extensions.

[1]  Gabriel M. Kuper,et al.  The logical data model , 1993, TODS.

[2]  Luca Cabibbo.  Querying and Updating Complex-Object Databases , 1996 .

[3]  Jianwen Su,et al.  Algebraic and Calculus Query Languages for Recursively Typed Complex Objects , 1993, J. Comput. Syst. Sci..

[4]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

[5]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[6]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[7]  Mihalis Yannakakis,et al.  On Datalog vs. polynomial time (extended abstract) , 1991, PODS '91.

[8]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[9]  Masatoshi Yoshikawa,et al.  ILOG: Declarative Creation and Manipulation of Object Identifiers , 1990, VLDB.

[10]  Jianwen Su,et al.  Deductive Query Languages for Recursively Typed Complex Objects , 1998, J. Log. Program..

[11]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[12]  Luca Cabibbo.  On the Power of Stratified Logic Programs with Value Invention for Expressing Database Transformations , 1995, ICDT.

[13]  Luca Cabibbo.  Universit a Degli Studi the Expressive Power of Stratiied Logic Programs with Value Invention Programs with Value Invention for Expressing Database Transformations" in International , 2007 .

[14]  Jan Gilbert Van Den Bussche.  Formal aspects of object identity in database manipulation , 1993 .

[15]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[16]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[17]  Masatoshi Yoshikawa,et al.  On the equivalence of database restructurings involving object identifiers (extended abstract) , 1991, PODS.

[18]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Jianwen Su,et al.  Untyped sets, invention, and computable queries , 1989, PODS '89.

[20]  Jan Van den Bussche,et al.  On the completeness of object-creating query languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[21]  Phokion G. Kolaitis,et al.  On the Expressive Power of Datalog: Tools and a Case Study , 1995, J. Comput. Syst. Sci..

[22]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..