Fixpoint extensions of first-order logic and datalog-like languages

Datalog extensions with fixpoint semantics motivated by database queries and updates are studied. The authors suggest nontrivial fixpoint extensions of first-order logic with nondeterministic and/or noninflationary semantics. Certain properties of the language FO+IFP, such as the collapse of the hierarchy (based on the nesting of fixpoints) or the existential normal form, hold for these various logics. Their expressive power is characterized.<<ETX>>

[1]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[2]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[3]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  A. Leisenring.  Mathematical logic and Hilbert's ε-symbol , 1971 .

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

[6]  Ashok K. Chandra.  Programming primitives for database languages , 1981, POPL '81.

[7]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[8]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[9]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[11]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[12]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

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

[14]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[15]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

[16]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[17]  Richard Hull.  Relative Information Capacity of Simple Relational Database Schemata , 1986, SIAM J. Comput..

[18]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[19]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).