Compiling Specificity Into Approaches to Nonmonotonic Reasoning
نویسندگان
چکیده
We present a general approach for introducing specificity information into nonmonotonic theories. Historically, many approaches to nonmonotonic reasoning, including default logic, circumscription, and autoepistemic logic, do not provide an account of specificity, and so fail to enforce specificity among default sentences. In our approach, a default theory is initially given as a set of strict and defeasible rules. By making use of a theory of default conditionals, here given by System Z, we isolate minimal sets of defaults with specificity conflicts. From the specificity information intrinsic in these sets, a default theory in a target language is specified. For default logic the end result is a semi-normal default theory; in circumscription the end result is a set of abnormality propositions that, when circumscribed, yield a theory in which specificity information is appropriately handled. We mainly deal with default logic and circumscription although we also consider autoepistemic logic, Theorist, and variants of default logic and circumscription. This approach differs from previous work in that specificity information is obtained from information intrinsic in a set of conditionals, rather than assumed to exist a priori. Moreover, we deal with the “standard” version of, for example default logic and circumscription, and do not rely on prioritised versions, as
منابع مشابه
An argument-based approach to reasoning with specificity
We present a new priority-based approach to reasoning with specificity which subsumes inheritance reasoning. The new approach differs from other priority-based approaches in the literature in the way priority between defaults is handled. Here, it is conditional rather than unconditional as in other approaches. We show that any unconditional handling of priorities between defaults as advocated i...
متن کاملCompiling Preference Queries in Qualitative Constraint Problems
Comparative preference statements are the basic ingredients of conditional logics for representing users’ preferences in a compact way. These statements may be strict or not and obey different semantics. Algorithms have been developed in the literature to compute a preference relation over outcomes given a set of comparative preference statements and one or several semantics. These algorithms a...
متن کاملRelations between assumption-based approaches in nonmonotonic logic and formal argumentation
In this paper we make a contribution to the unification of formal models of defeasible reasoning. We present several translations between formal argumentation frameworks and nonmonotonic logics for reasoning with plausible assumptions. More specifically, we translate adaptive logics into assumption-based argumentation and ASPIC, ASPIC into assumption-based argumentation and a fragment of assump...
متن کاملNonmonotonic Reasoning, Argumentation and Machine Learning
Machine learning and nonmonotonic reasoning are closely related, both concerned with making plausible as well as certain inferences based on available data. In this document a brief overview of diierent approaches to nonmonotonic reasoning is presented , and it is shown how the concept of argumentation systems arises. The relationship with machine learning work is also discussed. The document a...
متن کاملCombining Classification and Nonmonotonic Inheritance Reasoning: A First Step
The formal analysis of semantic networks and frame systems led to the development of nonmonotonic inheritance networks and termi-nological logics. While nonmonotonic inheritance networks formalize the notion of default inheritance of typical properties, terminological logics formalize the notion of deening concepts and reasoning about deenitions. Although it seems to be desirable to (re-)unify ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 90 شماره
صفحات -
تاریخ انتشار 1997