Arrow Research search
Back to TCS

TCS 1997

Annotated nonmonotonic rule systems

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

Annotated logics were proposed by Subrahmanian as a unified paradigm for representing a wide variety of reasoning tasks including reasoning with uncertainty within a single theoretical framework. Subsequently, Marek, Nerode and Remmel have shown how to provide nonmonotonic extensions of arbitrary languages through their notion of a nonmonotonic rule systems. The primary aim of this paper is to define annotated nonmonotonic rule systems which merge these two frameworks into a general purpose nonmonotonic reasoning framework over arbitrary multiple-valued logics. We then show how Reiter's normal default theories may be generalized to the framework of annotated nonmonotonic rule systems.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
137251891976685238
v2026.09.13