✦ LIBER ✦

Modal Logic for Rewriting Theories

✍ Scribed by Dirk Pattinson

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 203 KB
Volume: 36
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80145-8

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Rewrite rule systems for modal propositi

Rewrite rule systems for modal propositional logic

✍ Annie Foret 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 885 KB

A Logic for Rewriting Strategies

✍ Richard B. Kieburtz 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 336 KB

New Foundations for Rewriting Logic

✍ Hendrik Hilberdink 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

This paper presents an abstract treatment of the foundations of rewriting logic, generalising in three ways: an arbitrary 2-category plays the role of the specific 2-category Cat; the foundations are rendered fully independent of the underlying equational logic; and the semantics covers non-conventi

Modal sequents for normal modal logics

✍ Claudio Cerrato 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

## Abstract We present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut elimination theorem for the basic system K, so as completeness theorems (in the new style) both for K itself and for its most popular enrichments. MSC: 03B45, 03

Dempster–Shafer theory framed in modal l

Dempster–Shafer theory framed in modal logic

✍ Elena Tsiporkova; Veselka Boeva; Bernard De Baets 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 144 KB

A general theory of confluent rewriting

A general theory of confluent rewriting systems for logic programming and its applications

✍ Jürgen Dix; Mauricio Osorio; Claudia Zepeda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 236 KB

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