Similarity preservation in default logic
暂无分享,去创建一个
The paper identifies a problem in default reasoning in Reiter’s Default Logic and related systems: elements which are similar given the axioms only, become distinguishable in extensions. We explain why, sometimes, this is considered undesirable. Two approaches are presented for guaranteeing similarity preservation: One approach formalizes a way of uniformly applying the defaults to all similar elements by introducing generic extensions, which depend only on similarity types of objects. According to the second approach, for a restricted class of default theories, a default theory is viewed as a “shorthand notation” to what is “really meant” by its formulation. In this approach we propose a rewriting of defaults in a form that guarantees similarity preservation of the modified theory. It turns out that the above two approaches yield the same result.
[1] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[2] Georg Gottlob,et al. Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..
[3] Michael Kaminski. A Comparative Study of Open Default Theories , 1995, Artif. Intell..
[4] David Poole,et al. A Logical Framework for Default Reasoning , 1988, Artif. Intell..
[5] Torsten Schaub,et al. Alternative Approaches to Default Logic , 1994, Artif. Intell..