scientific article; zbMATH DE number 1301603

From MaRDI portal
Publication:4246796





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].





Describes a project that uses

Uses Software






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)