Skip to main content

Experimental Descriptive Complexity

  • Chapter
  • 785 Accesses

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 7230)

Abstract

We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counter- examples of conjectures, reductions between problems, and visualizations of structures and queries.

DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/~immerman/de. We encourage researchers and students at all levels to experiment with it. Please tell us of your insights, progress, suggestions, or extensions of DE.

Keywords

  • Logical Formula
  • Graph Property
  • Propositional Formula
  • Relation Symbol
  • Constant Symbol

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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. Cai, J., Fürer, M., Immerman, N.: An Optimal Lower Bound on the Number of Variables for Graph Identification. Combinatorica 12(4), 389–410 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Crouch, M., Immerman, N., Moss, J.E.B.: Finding Reductions Automatically. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 181–200. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  3. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  4. Dawar, A., Grohe, M., Holm, B., Laubner, B.: Logics with Rank Operators. In: IEEE Symp. Logic In Comput. Sci., pp. 113–122 (2009)

    Google Scholar 

  5. Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Karp, R. (ed.) Complexity of Computation. SIAM-AMS Proc., vol. 7, pp. 43–73 (1974)

    Google Scholar 

  6. Grohe, M.: Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. In: IEEE Symp. Logic In Comput. Sci., pp. 179–188 (2010)

    Google Scholar 

  7. Immerman, N.: Descriptive Complexity. Springer Graduate Texts in Computer Science, New York (1999)

    Google Scholar 

  8. Immerman, N.: Descriptive Complexity: A Logician’s Approach to Computation. Notices of the American Mathematical Society 42(10), 1127–1133 (1995)

    MathSciNet  MATH  Google Scholar 

  9. Immerman, N.: Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. 17(5), 935–938 (1988)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Immerman, N.: Languages That Capture Complexity Classes. SIAM J. Comput. 16(4), 760–778 (1987)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Immerman, N.: Relational Queries Computable in Polynomial Time. Information and Control 68, 86–104 (1986); A preliminary version of this paper appeared in ACM Symp. Theory of Comput., pp. 147–152 (1982)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Immerman, N., Lander, E.S.: Describing Graphs: A First-Order Approach to Graph Canonization. In: Selman, A. (ed.) Complexity Theory Retrospective, pp. 59–81. Springer, Heidelberg (1990)

    CrossRef  Google Scholar 

  13. Ladner, R.: On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22(1), 155–171 (1975)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  15. Rogers, G.: What’s Wrong With This Picture?, http://www.garnetrogers.com/lyrics/What's%20Wrong%20With%20This%20Picture.txt

  16. Szelepcsényi, R.: The Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica 26, 279–284 (1988)

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Vardi, M.: Complexity of Relational Query Languages. In: ACM Symp. Theory of Comput., pp. 137–146 (1982)

    Google Scholar 

  18. Valiant, L.: Reducibility By Algebraic Projections. L’Enseignement mathématique T. XXVIII(3-4), 253–268 (1982)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Carmosino, M., Immerman, N., Jordan, C. (2012). Experimental Descriptive Complexity. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29485-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29484-6

  • Online ISBN: 978-3-642-29485-3

  • eBook Packages: Computer ScienceComputer Science (R0)