CUMULATIVE DEFAULT LOGIC - FINITE CHARACTERIZATION, ALGORITHMS, AND COMPLEXITY

Authors
GOTTLOB G ZHANG MY
Citation
G. Gottlob et My. Zhang, CUMULATIVE DEFAULT LOGIC - FINITE CHARACTERIZATION, ALGORITHMS, AND COMPLEXITY, Artificial intelligence, 69(1-2), 1994, pp. 329-345
Citations number
17
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence",Ergonomics
Journal title
Artificial intelligence → ACNP
ISSN journal
00043702
Volume
69
Issue
1-2
Year of publication
1994
Pages
329 - 345
Database
ISI
SICI code
0004-3702(1994)69:1-2<329:CDL-FC>2.0.ZU;2-6
Abstract
Brewka's Cumulative Default Logic (CDL), a new version of Reiter's def ault logic, puts emphasis on the joint consistency among the justifica tions of all applied defaults to obtain cumulativity. In this paper, a finite characterization of CDL extensions using sets of generating de faults is given. From this characterization we derive new algorithms f or various reasoning tasks in CDL. Moreover, we show that (proposition al) cumulative default reasoning has the same complexity as classical default reasoning.