A rewriting point of view on strategies

Hélène Kirchner

This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy. Based on rewriting concepts, several definitions of strategy are reviewed and connected: in order to catch the higher-order nature of strategies, a strategy is defined as a proof term expressed in the rewriting logic or in the rewriting calculus; to address in a coherent way deduction and computation, a strategy is seen as a subset of derivations; and to recover the definition of strategy in sequential path-building games or in functional programs, a strategy is considered as a partial function that associates to a reduction-in-progress, the possible next steps in the reduction sequence.

In Fabio Mogavero, Aniello Murano and Moshe Y. Vardi: Proceedings 1st International Workshop on Strategic Reasoning (SR 2013), Rome, Italy, March 16-17, 2013, Electronic Proceedings in Theoretical Computer Science 112, pp. 99–105.
Published: 1st March 2013.

ArXived at: https://dx.doi.org/10.4204/EPTCS.112.15 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org