Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3835))

  • 714 Accesses

Abstract

Ehrenfeucht-Fraïssé games are commonly used as a method to measure the expressive power of a logic, but they are also a flexible tool to compare structures. To exploit such a comparison power, explicit conditions characterizing the winning strategies for both players must be provided. We give a necessary and sufficient condition for Duplicator to win games played on finite structures with a successor relation and a finite number of unary predicates. This structural characterization suggests an algorithmic approach to the analysis of games, which can be used to compute the “remoteness” of a game and to determine the optimal moves for both players, that is, to derive algorithms for Spoiler and Duplicator that play optimally. We argue that such an algorithmic solution may be used in contexts where the “degree of similarity” between two structures must be measured, such as the comparison of biological sequences.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arora, S., Fagin, R.: On winning strategies in Ehrenfeucht-Fraïssé games. Theoretical Computer Science 174, 97–121 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, 2nd edn., January. A K Peters Ltd, Wellesley (2003)

    Google Scholar 

  3. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  4. Ehrenfeucht, A.: An application of games to the completeness problem for formalized theory. Fundamenta Mathematicae 49, 129–141 (1961)

    MATH  MathSciNet  Google Scholar 

  5. Fagin, R., Stockmeyer, L., Vardi, M.Y.: On monadic NP vs. monadic co-NP. Inform. and Comput. 120(1), 78–92 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fraïssé, R.: Sur quelques classifications des systèmes de relations. Publications Scientifiques 1, 35–182 (1954)

    Google Scholar 

  7. Gaifman, H.: On local and nonlocal properties. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium, Logic Colloquium 1981, pp. 105–135. North Holland Pub. Co., Amsterdam (1982)

    Chapter  Google Scholar 

  8. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  9. Hanf, W.: Model-Theoretic Methods in the Study of Elementary Logic. In: Addison, J.W., Henkin, L., Tarski, A. (eds.) The Theory of Models, pp. 132–145. North-Holland, Amsterdam (1965)

    Google Scholar 

  10. Hintikka, J.: Distributive normal forms in the calculus of predicates. Acta Philosofica Fennica 6, 1–71 (1953)

    MathSciNet  Google Scholar 

  11. Keisler, H.J., Lotfallah, W.B.: Shrinking Games and Local Formulas. Annals of Pure and Applied Logic 128, 215–225 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Pevzner, P., Tesler, G.: Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes. Genome Res. 13(1), 37–45 (2003)

    Article  Google Scholar 

  13. Pezzoli, E.: Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 159–170. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Schwentick, T.: On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic 79, 61–92 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25(3), 360–376 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  16. Thomas, W.: On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 559–568. Springer, Heidelberg (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Udine, via delle Scienze 206, 33100, Udine (UD), Italy

    Angelo Montanari, Alberto Policriti & Nicola Vitacolonna

Authors
  1. Angelo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Policriti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Vitacolonna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Miami, USA

    Geoff Sutcliffe

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montanari, A., Policriti, A., Vitacolonna, N. (2005). An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_11

Download citation

  • DOI: https://doi.org/10.1007/11591191_11

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31650-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation