Skip to main content
SpringerLink
Log in

An Existential Locality Theorem

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2001)

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

Included in the following conference series:

Abstract

We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures.

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

Access this chapter

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.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. H.L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proceedings of the 14th International Workshop on Graph theoretic Concepts in Computer Science WG’88, volume 344 of Lecture Notes in Computer Science, pages 1–10. Springer-Verlag, 1988.

    Google Scholar 

  3. H.L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305–1317, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Diestel. Graph Theory. Springer-Verlag, second edition, 2000.

    Google Scholar 

  5. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. In Proceedings of the 5th International Conference on Database Theory, volume 1186 of Lecture Notes in Computer Science, pages 140–154. Springer-Verlag, 1997.

    Google Scholar 

  6. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.

    Google Scholar 

  7. R.G. Downey, M.R. Fellows, and U. Taylor. The parameterized complexity of relational database queries and an improved characterization of W[1]. In Bridges, Calude, Gibbons, Reeves, and Witten, editors, Combinatorics, Complexity, and Logic-Proceedings of DMTCS’ 96, pages 194–213. Springer-Verlag, 1996.

    Google Scholar 

  8. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, second edition, 1995.

    Google Scholar 

  9. D. Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27:275–291, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. In Jan van den Bussche and Victor Vianu, editors, Proceedings of the 8th International Conference on Database Theory, volume 1973 of Lecture Notes in Computer Science, pages 22–38. Springer Verlag, 2001.

    Google Scholar 

  11. M. Frick and M. Grohe. Deciding first-order properties of locally tree-decomposable structures. Currently available at http://www.mat0h.uic.edu/~grohe. A preliminary version of the paper appeared in Proceedings of the 26th International Colloquium on Automata, Languages and Programming, LNCS 1644, Springer-Verlag, 1999.

    Chapter  Google Scholar 

  12. H. Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium’ 81. North Holland, 1982.

    Google Scholar 

  13. M. Grohe and S. Wöhrle. An existential locality theorem. Technical Report AIB-2001-07, RWTH Aachen, 2001.

    Google Scholar 

  14. L. Hella, L. Libkin, J. Nurmonen, and L. Wong. Logics with aggregate operators. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science, 1999.

    Google Scholar 

  15. L. Hella, L. Libkin, and Y. Nurmonen. Notions of locality and their logical characterizations over finite models. Journal of Symbolic Logic, 64:1751–1773, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  16. L. Libkin. Logics with counting and local properties. ACM Transaction on Computational Logic, 1:33–59, 2000.

    Article  MathSciNet  Google Scholar 

  17. N. Robertson and P.D. Seymour. Graph minors III. Planar tree-width. Journal of Combinatorial Theory, Series B, 36:49–64, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  18. L.J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.

    Google Scholar 

  19. P. van Emde Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 1, pages 1–66. Elsevier Science Publishers, 1990.

    Google Scholar 

  20. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137–146, 1982.

    Google Scholar 

  21. S. Wöhrle. Lokalität in der Logik und ihre algorithmischen Anwendungen. Diploma thesis, Faculty of Mathematics, Albert-Ludwigs-University Freiburg, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, EH9 3JZ, Scotland, UK

    Martin Grohe

  2. Lehrstuhl für Informatik VII, RWTH Aachen, 52056, Aachen, Germany

    Stefan Wöhrle

Authors
  1. Martin Grohe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Wöhrle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LSV (Ecole Normale Supérieure de Cachan and CNRS), 61, Avenue du Président Wilson, 94230, Cachan, France

    Laurent Fribourg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grohe, M., Wöhrle, S. (2001). An Existential Locality Theorem. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44802-0_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42554-0

  • Online ISBN: 978-3-540-44802-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation