Default reasoning via negation as failure
Ημερομηνία
1994ISSN
0302-9743Source
Workshop on Theoretical Foundations of Knowledge Representation and Reasoning held in conjunction with 10th European Conference on Artificial Intelligence, ECAI 1992Volume
810 LNAIPages
160-178Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
We show how recent developments in the study of negation as failure of Logic Programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with which we extend the underlying theory, given by the logic program, provided that this extension satisfies an appropriate criterion, called acceptability. The generalization of logic programming to more general representation frameworks is done by adapting this view of NAF and the basic notion of acceptability to the new frameworks. In general, an extension of a given theory by a set of hypotheses (e.g. defaults) is acceptable if it can render any other conflicting extension not acceptable thus ensuring that it is a “selfjustified” set of assumptions. We compare our framework with other existing non-monotonic frameworks such as Default Logic and Theorist. In particular, we will show how our framework includes and extends Default Logic. © 1994, Springer Verlag. All rights reserved.