Action and change in rewriting logic.

*(English)*Zbl 0930.03028
Pareschi, Remo (ed.) et al., Dynamic worlds. From the frame problem to knowledge management. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 12, 1-53 (1999).

Syntax, rules of deduction and model theory of rewriting logic are explained. The Maude language and the MaudeLog language are briefly introduced since they are used in examples throughout the paper. A sequence of planning examples together with solutions are presented and it is shown how they can be expressed in rewriting logic. Maps from linear logic and from Horn logic with equality into rewriting logic are shown. It is also shown how concurrent object-oriented systems are naturally represented in rewriting logic. A fully satisfactory solution to the frame problem, including residual aspects of the problem that are often hard to deal with, is provided by means of rewriting logic.

For the entire collection see [Zbl 0913.00018].

For the entire collection see [Zbl 0913.00018].

Reviewer: D.Gruska (Bratislava)

##### MSC:

03B60 | Other nonclassical logic |

68Q42 | Grammars and rewriting systems |

03B70 | Logic in computer science |

68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |

68T30 | Knowledge representation |

68T27 | Logic in artificial intelligence |