TY - JOUR
T1 - Splitting Finite Default Theories
T2 - A Comparison of Two Approaches
AU - Antoniou, Grigoris
PY - 1999/4/1
Y1 - 1999/4/1
N2 - Default logic is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, "local" way. This paper compares two recent approaches, Turner's splitting and Cholewinski's stratification. It shows that the approaches are closely related - in fact the former can be viewed as a special case of the latter.
AB - Default logic is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, "local" way. This paper compares two recent approaches, Turner's splitting and Cholewinski's stratification. It shows that the approaches are closely related - in fact the former can be viewed as a special case of the latter.
KW - Default logic
KW - Knowledge representation
KW - Nonmonotonic reasoning
KW - Splitting
UR - http://www.scopus.com/inward/record.url?scp=53149149062&partnerID=8YFLogxK
U2 - 10.1023/A:1008251012187
DO - 10.1023/A:1008251012187
M3 - Article
AN - SCOPUS:53149149062
VL - 8
SP - 205
EP - 216
JO - Journal of Logic, Language and Information
JF - Journal of Logic, Language and Information
SN - 0925-8531
IS - 2
ER -