Skip to main content
SpringerLink
Log in
Book cover

East European Conference on Advances in Databases and Information Systems

ADBIS 2004: Advances in Databases and Information Systems pp 1–21Cite as

Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3255))

Abstract

We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boolean algebras of sets, this is a new generalization of Boole’s well-known variable elimination method for conjunctions of Boolean equality constraints. We also explain the connection of this new logical result with the evaluation of relational calculus queries on constraint databases that contain Boolean linear cardinality constraints.

This work was supported in part by USA National Science Foundation grant EIA-0091530.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Arnon, D.S., Collins, G.E., McCallum, S.: Cylindrical algebraic decomposition, I: The basic algorithm. SIAM Journal on Computing 13, 865–877 (1984)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Benedikt, M., Grohe, M., Libkin, L., Segoufin, L.: Reachability and connectivity queries in constraint databases. In: Proc. ACM Symposium on Principles of Database Systems, pp. 104–15 (2000)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Berman, L.: Precise bounds for Presburger arithmetic and the reals with addition. In: Proc. 18th IEEE FOCS, pp. 95–99 (1977)

    Google Scholar 

  7. Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol. 1059, pp. 30–43. Springer, Heidelberg (1996)

    Google Scholar 

  8. Brodsky, A., Segal, V., Chen, J., Exarkhopoulo, P.: The CCUBE constraint object-oriented database system. Constraints 2(3-4), 245–277 (1997)

    Article  MATH  Google Scholar 

  9. Byon, J.-H., Revesz, P.: DISCO: A constraint database system with sets. In: Kuper, G.M., Wallace, M. (eds.) CONTESSA-WS 1995 and CDB 1995. LNCS, vol. 1034, pp. 68–83. Springer, Heidelberg (1996)

    Google Scholar 

  10. Calvanese, D., Lenzerini, M.: On the interaction between ISA and cardinality constraints. In: Proceedings of the Tenth International Conference on Data Engineering, pp. 204–213. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  11. Calvanese, D., Lenzerini, M., Nardi, D.: A unified framework for class based representation formalisms. In: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, pp. 109–120. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  12. Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  13. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  14. Cox, J., McAloon, K.: Decision procedures for constraint based extensions of Datalog. In: Constraint Logic Programming, pp. 17–32. MIT Press, Cambridge (1993)

    Google Scholar 

  15. Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Undergraduate Texts in Mathematics. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  16. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, London (1972)

    MATH  Google Scholar 

  17. Fisher, M.J., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Proc. SIAM-AMS, vol. VII, American Mathematical Society, Providence (1974)

    Google Scholar 

  18. Fourier, J.B.J.: Solution d’une question particuliére du calcul des inégalités. Nouveau Bulletin des Sciences par la Société philomathique de Paris, pp. 99–100 (1826)

    Google Scholar 

  19. Gervet, C.: Conjunto: Constraint logic programming with finite set domains. In: Proc. International Logic Programming Symposium, pp. 339–358 (1994)

    Google Scholar 

  20. Goldin, D., Kanellakis, P.C.: Constraint query algebras. Constraints 1, 45–83 (1996)

    Article  MathSciNet  Google Scholar 

  21. Goldin, D., Kutlu, A., Song, M., Yang, F.: The constraint database framework: Lessons learned from CQA/CDB. In: Proc. International Conference on Data Engineering, pp. 735–737 (2003)

    Google Scholar 

  22. Grahne, G., Nykänen, M., Ukkonen, E.: Reasoning about strings in databases. Journal of Computer and System Sciences 59, 116–162 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Grumbach, S., Lacroix, Z.: Computing queries on linear constraint databases. In: 5th International Workshop on Database Programming Languages, Electronic Workshops in Computing, Springer, Heidelberg (1995)

    Google Scholar 

  24. Grumbach, S., Rigaux, P., Segoufin, L.: The DEDALE system for complex spatial queries. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 213–224 (1998)

    Google Scholar 

  25. Grumbach, S., Rigaux, P., Segoufin, L.: Spatio-temporal data handling with constraints. In: ACM Symposium on Geographic Information Systems, pp. 106–111 (1998)

    Google Scholar 

  26. Helm, R., Marriott, K., Odersky, M.: Spatial query optimization: From Boolean constraints to range queries. Journal of Computer and System Sciences 51(2), 197–201 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  27. Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proc. 14th ACM Symposium on Principles of Programming Languages, pp. 111–119 (1987)

    Google Scholar 

  28. Jaffar, J., Maher, M.: Constraint logic programming: A survey. J. Logic Programming 19/20, 503–581 (1994)

    Article  MathSciNet  Google Scholar 

  29. Kanellakis, P.C., Kuper, G.M., Revesz, P.: Constraint query languages. In: Proc. ACM Symposium on Principles of Database Systems, pp. 299–313 (1990)

    Google Scholar 

  30. Kanellakis, P.C., Kuper, G.M., Revesz, P.: Constraint query languages. Journal of Computer and System Sciences 51(1), 26–52 (1995)

    Article  MathSciNet  Google Scholar 

  31. Kuper, G.M., Libkin, L., Paredaens, J. (eds.): Constraint Databases. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  32. Marriott, K., Odersky, M.: Negative Boolean constraints. Theoretical Computer Science 160(1-2), 365–380 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  33. Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  34. Matiyasevich, Y.: Hilbert’s Tenth Problem. MIT Press, Cambridge (1993)

    Google Scholar 

  35. Ohlbach, H.J., Koehler, J.: How to extend a formal system with a Boolean algebra operator, pp. 57–75. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  36. Ohlbach, H.J., Koehler, J.: Modal logics, description logics, and arithmetic reasoning. Journal of Artificial Intelligence 109(1-2), 1–31 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  38. Presburger, M.: Über die vollständigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchem die addition als einzige operation hervortritt. In: Comptes Rendus, I. Congrès des Math. des Pays Slaves, pp. 192–201 (1929)

    Google Scholar 

  39. Ramakrishnan, R.: Database Management Systems. McGraw-Hill, New York (1998)

    Google Scholar 

  40. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computatio 13(3), 255–352 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  41. Revesz, P.: A closed form for Datalog queries with integer order. In: Kanellakis, P.C., Abiteboul, S. (eds.) ICDT 1990. LNCS, vol. 470, pp. 187–201. Springer, Heidelberg (1990)

    Google Scholar 

  42. Revesz, P.: A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science 116(1), 117–149 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  43. Revesz, P.: Constraint databases: A survey. In: Thalheim, B. (ed.) Semantics in Databases 1995. LNCS, vol. 1358, pp. 209–246. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  44. Revesz, P.: The evaluation and the computational complexity of Datalog queries of Boolean constraint databases. International Journal of Algebra and Computation 8(5), 472–498 (1998)

    Article  MathSciNet  Google Scholar 

  45. Revesz, P.: Safe Datalog queries with linear constraints. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 355–369. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  47. Revesz, P.: Introduction to Constraint Databases. Springer, New York (2002)

    MATH  Google Scholar 

  48. Revesz, P., Li, Y.: MLPQ: A linear constraint database system with aggregate operators. In: Proc. 1st International Database Engineering and Applications Symposium, pp. 132–137. IEEE Press, Los Alamitos (1997)

    Google Scholar 

  49. Rigaux, P., Scholl, M., Voisard, A.: Spatial Databases with Application to GIS. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  50. Salamon, A.: Implementation of a database system with Boolean algebra constraints. Master’s thesis, University of Nebraska-Lincoln (May 1998)

    Google Scholar 

  51. Seipel, D., Geske, U.: Solving cardinality constraints in (constraint) logic programming. In: Proceedings of the International Workshop on Functional and Logic Programming (2001)

    Google Scholar 

  52. Srivastava, D., Ramakrishnan, R., Revesz, P.: Constraint objects. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 218–228. Springer, Heidelberg (1994)

    Google Scholar 

  53. Stone, M.H.: The theory of representations for Boolean algebras. Transactions of the American Mathematical Society 40, 37–111 (1936)

    MATH  MathSciNet  Google Scholar 

  54. Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)

    MATH  Google Scholar 

  55. Williams, H.P.: Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A) 21, 118–123 (1976)

    Article  MATH  Google Scholar 

  56. Wolper, P., Boigelot, B.: An automata-theoretic approach to Presburger arithmetic constraints. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol. 983, pp. 21–32. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE, 68588, USA

    Peter Revesz

Authors
  1. Peter Revesz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Data Mining and Web search Research Group, Informatics Laboratory Computer and Automation Research Institute of the Hungarian Academy of Sciences,  

    András Benczúr

  2. MTA SZTAKI, Computer and Automation Institute, of the Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    János Demetrovics

  3. Oxford University Computing Laboratory, Wolfson Building Parks Road, OX1 3QD, Oxford, United Kingdom

    Georg Gottlob

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Revesz, P. (2004). Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds) Advances in Databases and Information Systems. ADBIS 2004. Lecture Notes in Computer Science, vol 3255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30204-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30204-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30204-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation