scientific article; zbMATH DE number 1301603
concurrent object-oriented systemsframe problemHorn logic with equalitylinear logicMaudeMaudeLogplanning problemrewriting logic
Other nonclassical logic (03B60) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
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].
- On linear logic planning and concurrency
- Rewriting logic: Roadmap and bibliography
- Twenty years of rewriting logic
- Parameterized strategies specification in Maude
- Two Decades of Maude
- scientific article; zbMATH DE number 1523021 (Why is no real title available?)
- A Representation Theorem for Change through Composition of Activities
- A rewriting framework for activities subject to regulations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246796)