Skip to main content
SpringerLink
Log in
Book cover

Finite Model Theory and Its Applications pp 257–337Cite as

Embedded Finite Models and Constraint Databases

  • Chapter

Part of the book series: Texts in Theoretical Computer Science an EATCS Series ((TTCS))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. F. Afrati, T. Andronikos, and T. Kavalieros. On the expressiveness of query languages with linear constraints: capturing desirable spatial properties. In Constraint Databases and Applications, Lecture Notes in Computer Science vol. 1191, pages 105–115, Springer 1997.

    Google Scholar 

  3. A. K. Ailamazyan, M. M. Gilula, A. P. Stolboushkin and G. F. Shvarts. Reduction of a relational model with infinite domains to the finite-domain case. Doklady Akademii Nauk SSSR, 286(1):308–311, 1986. Translation in Soviet Physics – Doklady, 31:11–13, 1986.

    MathSciNet  Google Scholar 

  4. M. Ajtai. Σ 11 formulae on finite structures. Annals of Pure and Applied Logic, 24:1–48, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Anthony and N. Biggs. Computational Learning Theory. Cambridge University Press, 1992.

    Google Scholar 

  6. A. Avron and J. Hirshfeld. On first order database query languages. In IEEE Symposium on Logic in Computer Science, pages 226–231, 1991.

    Google Scholar 

  7. J. Baldwin and M. Benedikt. Stability theory, permutations of indiscernibles, and embedded finite models. Transactions of the American Mathematical Society 352:4937–4969, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Basu. New results on quantifier elimination over real closed fields and applications to constraint databases. Journal of the ACM, 46:537–555, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  9. O. Belagradek, A. Stolboushkin, and M. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 97:85–125, 1999.

    Article  MathSciNet  Google Scholar 

  10. R. Benedetti and J.-J. Risler. Real Algebraic and Semi-algebraic Sets. Hermann, Paris, 1990.

    Google Scholar 

  11. M. Benedikt, G. Dong, L. Libkin and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45:1–34, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Benedikt, M. Grohe, L. Libkin and L. Segoufin. Reachability and connectivity queries in constraint databases. Journal of Computer and System Sciences, 66(1):169–206, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Benedikt and H. J. Keisler. Definability with a predicate for a semi-linear set. Journal of Symbolic Logic 68(1):319-351, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Benedikt and L. Libkin. On the structure of queries in constraint query languages. In IEEE Symposium on Logic in Computer Science, pages 25–34, 1996.

    Google Scholar 

  15. M. Benedikt and L. Libkin. Relational queries over interpreted structures. Journal of the ACM, 47:644–680, 2000.

    Article  MathSciNet  Google Scholar 

  16. M. Benedikt and L. Libkin. Safe constraint queries. SIAM Journal on Computing, 29:1652–1682, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  17. M. Benedikt and L. Libkin. Aggregate operators in constraint query languages. Journal of Computer and System Sciences, 64:628–654, 2000.

    Article  MathSciNet  Google Scholar 

  18. M. Benedikt and L. Libkin. Unpublished notes, 1999.

    Google Scholar 

  19. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. Definable relations and first-order query languages over strings. Journal of the ACM, 50(5):694-751, 2003.

    Article  MathSciNet  Google Scholar 

  20. A. Blumensath and E. Grädel. Automatic structures. In IEEE Symposium on Logic in Computer Science, pages 51–62, 2000.

    Google Scholar 

  21. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929–965, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry. Springer, 1998.

    Google Scholar 

  23. V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire. Logic and $p$-recognizable sets of integers. Bulletin of the Belgian Mathematical Society 1:191–238, 1994.

    MATH  Google Scholar 

  24. B. F. Caviness and J. R. Johnson, eds. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, 1998.

    Google Scholar 

  25. A. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21(2):156–178, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  26. C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1990.

    Google Scholar 

  27. O. Chapuis and P. Koiran. Definability of geometric properties in algebraically closed fields. Mathematical Logic Quarterly, 45:533–550, 1999.

    MATH  MathSciNet  Google Scholar 

  28. M. Davis. On the number of solutions of Diophantine equations. Proceedings of the AMS, 35:552–554, 1972.

    Article  MATH  Google Scholar 

  29. L. Denenberg, Y. Gurevich and S. Shelah. Definability by constant-depth polynomial-size circuits. Information and Control, 70:216–240, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  30. F. Dumortier, M. Gyssens, L. Vandeurzen, and D. Van Gucht. On the decidability of semi-linearity of semi-algebraic sets, and its implications for spatial databases. Journal of Computer and System Sciences, 58:535–571, 1999. Correction in Journal of Computer and System Sciences, 59:557–562, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  31. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.

    Google Scholar 

  32. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.

    Google Scholar 

  33. M. Escobar-Molano, R. Hull and D. Jacobs. Safety and translation of calculus queries with scalar functions. In ACM Symposium on Principles of Database Systems, pages 253–264, 1993.

    Google Scholar 

  34. J. Flum and M. Ziegler. Pseudo-finite homogeneity and saturation. Journal of Symbolic Logic, 64:1689–1699, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  35. M. Furst, J. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17:13–27, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  36. R. L. Graham, B .L. Rothschild, and J .H. Spencer. Ramsey Theory. Wiley, New York, 1990.

    Google Scholar 

  37. E. Grädel and Y. Gurevich. Metafinite model theory. Information and Computation, 140:26–81, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  38. E. Grädel and S. Kreutzer. Descriptive complexity theory for constraint databases. In Conf. on Computer Science Logic, pages 67–81, 1999.

    Google Scholar 

  39. M. Grohe and L. Segoufin. On first-order topological queries. ACM Transactions on Computational Logic, 3:336–358, 2002.

    Article  MathSciNet  Google Scholar 

  40. S. Grumbach and G. Kuper. Tractable recursion over geometric data. In Proc. of Constraint Programming, pages 450–462, 1997.

    Google Scholar 

  41. S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173:151–181, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  42. Y. Gurevich. Toward logic tailored for computational complexity. In Computation and Proof Theory, pages 175–216, Springer 1984.

    Google Scholar 

  43. D. Harel. Towards a theory of recursive structures. In Conference on Mathematical Foundations of Computer Science, pages 36–53, 1998.

    Google Scholar 

  44. W. Hodges. Model Theory. Cambridge, 1993.

    Google Scholar 

  45. R. Hull and J. Su. Domain independence and the relational calculus. Acta Informatica, 31:513–524, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  46. R. Hull and C. K. Yap. The format model: a theory of database organization. Journal of the ACM, 31:518–537, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  47. O. H. Ibarra and J. Su. A technique for proving decidability of containment and equivalence of linear constraint queries. Journal of Computer and System Sciences, 59:1–28, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  48. N. Immerman. Descriptive Complexity. Springer, 1999.

    Google Scholar 

  49. P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51:26–52, 1995. Extended abstract in ACM Symposium on Principles of Database Systems, pages 299–313, 1990.

    Google Scholar 

  50. M. Karpinski and A. Macintyre. Approximating the volume of general Pfaffian bodies. In Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht, Lecture Notes in Computer Science vol. 1261, pages 162–173, Springer 1997.

    Google Scholar 

  51. B. Khoussainov and A. Nerode. Automatic presentations of structures.In Logic and Computational Complexity, Lecture Notes in Computer Science vol. 960, pages 367–392, Springer 1994.

    Google Scholar 

  52. P. Koiran. Approximating the volume of definable sets. In Symposium on Foundations of Computer Science, pages 134–141, 1995. %Milwaukee, Wisconsin, 23-25 October 1995. IEEE

    Google Scholar 

  53. B. Kuijpers, J. Paredaens, and J. Van den Bussche. Topological elementary equivalence of closed semi-algebraic sets in the real plane. Journal of Symbolic Logic, 65:1530–1555, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  54. B. Kuijpers and J. Van den Bussche. On capturing first-order topological properties of planar spatial databases. In Int. Conf. on Database Theory, pages 187–198, 1999.

    Google Scholar 

  55. G. Kuper, L. Libkin and J. Paredaens, eds. Constraint Databases. Springer, 2000.

    Google Scholar 

  56. M. C. Laskowski. Vapnik-Chervonenkis classes of definable sets. Journal of the London Mathematical Society, 45:377–384, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  57. L. Libkin. Elements of Finite Model Theory. Springer, 2004.

    Google Scholar 

  58. D. Marker, M. Messmer, and A. Pillay. Model Theory of Fields. Springer, 1996.

    Google Scholar 

  59. M. Otto and J. Van den Bussche. First-order queries on databases embedded in an infinite structure. Information Processing Letters, 60:37–41, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  60. C. Papadimitriou, D. Suciu, and V. Vianu. Topological queries in spatial databases. Journal of Computer and System Sciences, 58:29–53, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  61. J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. SIAM Journal on Computing, 27:1747–1763, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  62. A. Pillay and C. Steinhorn. Definable sets in ordered structures. Bulletin of the AMS, 11:159–162, 1984.

    MATH  MathSciNet  Google Scholar 

  63. A. Pillay and C. Steinhorn. Definable sets in ordered structures. III. Transactions of the American Mathematical Society, 309:469–476, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  64. B. Poizat. A Course in Model Theory. Springer, 2000.

    Google Scholar 

  65. P. Revesz. Safe query languages for constraint databases. ACM Transactions on Database Systems, 23:58–99, 1998.

    Article  Google Scholar 

  66. L. Segoufin. Personal communication, 2001.

    Google Scholar 

  67. L. Segoufin and V. Vianu. Querying spatial databases via topological invariants. Journal of Computer and System Sciences, 61:270–301, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  68. S. Shelah. Stability, the f.c.p., and superstability. Annals of Mathematical Logic, 3:271–362, 1971.

    Article  MATH  Google Scholar 

  69. J. Spencer. The Strange Logic of Random Graphs. Springer, 2001.

    Google Scholar 

  70. A. Stolboushkin and M. Taitslin. Finite queries do not have effective syntax. Information and Computation, 153:99–116, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  71. A. Stolboushkin and M. Taitslin. Linear vs. order constraint queries over rational databases. In ACM Symposium on Principles of Database Systems, pages 17–27, 1999.

    Google Scholar 

  72. A. Stolboushkin and M. Taitslin. Safe stratified datalog with integer order does not have syntax. ACM Transactions on Database Systems, 23:100–109, 1998.

    Article  Google Scholar 

  73. J. D. Ullman and J. Widom. A First Course in Database Systems. Prentice-Hall, 1997.

    Google Scholar 

  74. L. van den Dries. Remarks on Tarski’s problem concerning (R,+,*,exp). In Logic Colloquium 82, pages 97–121, North-Holland, 1984.

    Google Scholar 

  75. L. van den Dries. Tame Topology and O-Minimal Structures. Cambridge University Press, 1998.

    Google Scholar 

  76. L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In ACM Symposium on Principles of Database Systems, pages 109–118, 1998.

    Google Scholar 

  77. L. Vandeurzen, M. Gyssens and D. Van Gucht. On the expressiveness of linear-constraint query languages for spatial databases. Theoretical Computer Science 254:423–463, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  78. M. Y. Vardi. The decision problem for database dependencies. Information Processing Letters, 12:251–254, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  79. A. J. Wilkie. Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function. Journal of the American Mathematical Society, 9:1051–1094, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  80. M. Yannakakis. Personal communication, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics Univ. of Edinburgh, Edinburgh, EH8 9LE, UK

    Leonid Libkin

Authors
  1. Leonid Libkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Libkin, L. (2007). Embedded Finite Models and Constraint Databases. In: Finite Model Theory and Its Applications. Texts in Theoretical Computer Science an EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68804-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-68804-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00428-8

  • Online ISBN: 978-3-540-68804-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation