Splitting finite default theories: A comparison of two approaches

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. © 1999 Kluwer Academic Publishers.