Author name cluster

A. Nerode

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers

1 author row

TCS Journal 1997 Journal Article

Annotated nonmonotonic rule systems

A. Nerode
J.B. Remmel
V.S. Subrahmanian

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.

Details DOI

I&C Journal 1995 Journal Article

Computing Circumscriptive Databases

A. Nerode
R.T. Ng
V.S. Subrahmanian

Though circumscription was introduced by McCarthy over a decade ago, there has been relatively little work on algorithms for computing circumscriptive databases. In this paper, we develop algorithms to compute the preferred models of circumscriptive databases at compile-time using mixed integer linear programming techniques. Two advantages of this (bottom-up) approach are that it makes efficient re-use of previous computations and it provides much faster run-time performance. Some other advantages of using linear programming to automate deduction at compile time are that its re-optimization facilities elegantly accommodate database updates and also that it leads to a completely declarative formulation in which ordering of rules and literals in rule bodies plays no real role. Finally, we plan to use a standard relational database system as our run-time environment; this should yield relatively fast run-time processing, and provide a more expressive query language in which aggregates and the like can be expressed easily.

Details DOI