Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Ebbinghaus, J. Flum, W. Thomas (1984)
Mathematical Logic
M. Otto (1997)
Bounded Variable Logics and Counting
S. Abiteboul, M. Vardi, V. Vianu (1997)
Fixpoint logics, Relational machines, and computational complexityJournal of ACM, 44
S. Abiteboul, R. Hull, V. Vianu (1994)
Foundations of Databases
H. Ebbinghaus (1985)
Model Theoretic Logics
N. Immerman (1999)
Descriptive Complexity
M. Davis, R. Sigal, E. Weyuker (1994)
Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science
N. Immerman (1982)
Upper and lower bounds for first order expressibilityJ. Comput. System Sci., 25
J.M. Turull Torres (2000)
Proceedings of the 1st International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2000
D. Barrington, N. Immerman, H. Straubing (1990)
On uniformity within NC 1J. Comput. System Sci., 41
S. Abiteboul, C. Papadimitriou, V. Vianu (1998)
Reflective relational machinesInform. Comput., 143
C. Chang, H. Keisler (1992)
Model Theory
J. Tyszkiewicz (1997)
Queries and algorithms computable by polynomial time existential reflective machinesFundamenta Informaticae, 32
S. Abiteboul, M. Vardi, V. Vianu (1995)
Computing with infinitary logicTheoret. Comput. Sci., 149
A. Dawar, S. Lindell, S. Weinstein (1995)
Infinitary logic and inductive definability over finite structureInform. and Comput., 119
J. Balcázar, J. Díaz, J. Gabarró (1995)
Structural Complexity I
J.M. Turull Torres (1998)
Proceedings of the 2nd East European Symposium on Advances in Database and Information Systems, ADBIS'98, Lecture Notes in Computer Science, Vol. 1475
A. Dawar (1993)
Feasible computation through model theory
H. Ebbinghaus, J. Flum (1999)
Finite Model Theory
J.M. Turull Torres (1998)
Models, Algebras and Proofs: Selected Papers from the X Latin American Symposium on Mathematical Logic, Bogotá, 1995
S. Abiteboul, V. Vianu (1995)
Computing with first-order logicJ. Comput. System Sci., 50
A.K. Chandra, D. Harel (1980)
Computable queries for relational data basesJ. Comput. System Sci., 21
A.K. Chandra, D. Harel (1982)
Structure and complexity of relational queriesJ. Comput. System Sci., 25
We define four different properties of relational databases which are related tothe notion of homogeneity in classical model theory. The main question for their definition is, for any given database to determine the minimum integer k, such that whenever two k-tuples satisfy the same properties which are expressible in first order logic with up to k variables (FO k ), then there is an automorphism which maps each of these k-tuples onto each other. We study these four properties as a means to increase the computational power of subclasses of the reflective relational machines (RRMs) of bounded variable complexity. These were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu and are known to be incomplete. For this sake we first give a semantic characterization of the subclasses of total RRM with variable complexity k (RRM k ) for every natural number k. This leads to the definition of classes of queries denoted as Q C Q k . We believe these classes to be of interest in their own right. For each k>0, we define the subclass Q C Q k as the total queries in the class C Q of computable queries which preserve realization of properties expressible in FO k . The nature of these classes is implicit in the work of S. Abiteboul, M. Vardi and V. Vianu. We prove Q C Q k =total(RRM k ) for every k>0. We also prove that these classes form a strict hierarchy within a strict subclass of total(C Q). This hierarchy is orthogonal to the usual classification of computable queries in time-space-complexity classes. We prove that the computability power of RRM k machines is much greater when working with classes of databases which are homogeneous, for three of the properties which we define. As to the fourth one, we prove that the computability power of RRM with sublinear variable complexity also increases when working on databases which satisfy that property. The strongest notion, pairwise k-homogeneity, allows RRM k machines to achieve completeness.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 19, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.