We view models of rewrite theories enriched with observations coalgebraically. This allows us on the one hand to use "off the shelf" logics for coalgebras to specify and, on the other hand, to verify properties of rewriting programs and to obtain results about the expressive power of such languages.
Rewrite rule systems for modal propositional logic
β Scribed by Annie Foret
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 885 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Real-time decision systems are computer-controlled systems that must react to events in the external environment by making decisions based on sensor inputs and state information sufficiently fast to meet environment-imposed timing constraints. They are used in applications that would require human e
Recently, Brass and Dix showed (J. Automat. Reason. 20(1) (1998) 143-165) that the well founded semantics WFS can be deΓΏned as a con uent calculus of transformation rules. This led not only to a simple extension to disjunctive programs (J. Logic Programming 38(3) (1999) 167-213), but also to a new c