𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On cumulative default logics

✍ Scribed by Laura Giordano; Alberto Martelli


Book ID
102990226
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
941 KB
Volume
66
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis


Giordano, L. and A. Martelli, On cumulative default logics, Artificial Intelligence 66 (1994) 161-179.

Recently cumulative variants of Reiter's default logic have been proposed. All of them happen to be semimonotonic and to commit to assumptions, i.e. to require consistency of justifications. In this paper we define two new cumulative variants of default logic in the style of Brewka's CDL, which show that the above two properties are not required to achieve cumulativity. In fact, the first variant commits to assumptions, like Brewka's CDL, but it is not semimonotonic, and hence it allows priorities among defaults to be represented. The other cumulative variant does not even commit to assumptions, and thus it is very close to Reiter's default logic.

To overcome these problems, Brewka [2] has defined a Cumulative Default Logic (CDL) which is cumulative and commits to assumptions. To achieve this, Brewka introduces assertions, i.e. formulas labelled with a support, and strengthens the applicability conditions for defaults. However, CDL happens to be semimonotonic, which is often regarded as a desirable property from a


πŸ“œ SIMILAR VOLUMES


Cumulative default logic: Finite charact
✍ Georg Gottlob; Mingyi Zhang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 959 KB

Brewka's Cumulative Default Logic (CDL), a new version of Reiter's default logic, puts emphasis on the joint consistency among the justifications of all applied defaults to obtain cumulativity. In this paper, a finite characterization of CDL extensions using sets of generating defaults is given. Fro

Logical considerations on default semant
✍ William C. Rounds; Guo‐Qiang Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Springer Netherlands 🌐 English βš– 355 KB
General default logic
✍ Yi Zhou; Fangzhen Lin; Yan Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Springer Netherlands 🌐 English βš– 580 KB
Computing with default logic
✍ PawelΜ΅ CholewiΕ„ski; Victor W. Marek; MiroslΜ΅aw TruszczyΕ„ski; Artur Mikitiuk πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 508 KB

Default logic was proposed by Reiter as a knowledge representation tool. In this paper, we present our work on the Default Reasoning System, DeReS, the first comprehensive and optimized implementation of default logic. While knowledge representation remains the main application area for default logi