The Hardness of Revising Defeasible Preferences
MetadataShow full item record
Non-monotonic reasoning typically deals with three kinds of knowledge. Facts are meant to describe immutable statements of the environment. Rules define relationships among elements. Lastly, an ordering among the rules, in the form of a superiority relation, establishes the relative strength of rules. To revise a non-monotonic theory, we can change either one of these three elements. We prove that the problem of revising a non-monotonic theory by only changing the superiority relation is a NP-complete problem.
8th International Symposium, RuleML 2014, Co-located with the 21st European Conference on Artificial Intelligence, ECAI
© 2014 Springer International Publishing Switzerland 2014g. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
Analysis of Algorithms and Complexity