C.M. Teng. Possible world partition sequences: A unifying framework for uncertain reasoning. In Proc. 12th Conference on Uncertainty in Artificial Intelligence, 1996, 517-524.  Home/Search   Document Details and Download   Summary   Related Articles

....the logical language of T . Section 4 discusses some aspects of defeasible logic as a knowledge representation language, and illustrates some of them using well known examples. Section 5 gives a semantic characterization of a subset of defeasible logic. We use the semantic framework presented in [14, 15] which has been applied to a variety of logics for nonmonotonic and uncertainty reasoning [14] We show how we need to modify the framework to suit our purposes. Section 6 compares defeasible logic to some other known default reasoning approaches. Firstly we restate an older result [2] that ....

....representation language, and illustrates some of them using well known examples. Section 5 gives a semantic characterization of a subset of defeasible logic. We use the semantic framework presented in [14, 15] which has been applied to a variety of logics for nonmonotonic and uncertainty reasoning [14]. We show how we need to modify the framework to suit our purposes. Section 6 compares defeasible logic to some other known default reasoning approaches. Firstly we restate an older result [2] that nonmonotonic inheritance networks [8] are a special case of defeasible logic. Also, we show that ....

C.M. Teng. Possible world partition sequences: A unifying framework for uncertain reasoning. In Proc. 12th Conference on Uncertainty in Artificial Intelligence, 1996, 517-524.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC