๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New Foundations for Rewriting Logic

โœ Scribed by Hendrik Hilberdink

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
284 KB
Volume
36
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

โœฆ Synopsis

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-conventional sentences. Despite the high level of abstraction a number of properties of interest to Computing Science are seen to hold including the existence of initial models, liberality along theory morphisms, exactness, and a completeness theorem for a very abstract notion of deduction.

๐Ÿ“œ SIMILAR VOLUMES

A Logic for Rewriting Strategies
A Logic for Rewriting Strategies
โœ Richard B. Kieburtz ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 336 KB
Modal Logic for Rewriting Theories
Modal Logic for Rewriting Theories
โœ Dirk Pattinson ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 203 KB

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.

Alternative foundations for Reiter's def
Alternative foundations for Reiter's default logic
โœ Thomas Linke; Torsten Schaub ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 443 KB

We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from the necessity of exhaustive consistency checks with respect to the finally resulting set of conclusions; often this so-called ex