No label defined (Q4246796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1301603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1301603 |
Statements
8 February 2000
0 references
rewriting logic
0 references
frame problem
0 references
planning problem
0 references
Maude
0 references
MaudeLog
0 references
linear logic
0 references
Horn logic with equality
0 references
concurrent object-oriented systems
0 references
0.8423717617988586
0 references
0.82318115234375
0 references
0.8140805959701538
0 references
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].
0 references