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. © 2014 Springer International Publishing.
CITATION STYLE
Governatori, G., Olivieri, F., Scannapieco, S., & Cristani, M. (2014). The hardness of revising defeasible preferences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8620 LNCS, pp. 168–177). Springer Verlag. https://doi.org/10.1007/978-3-319-09870-8_12
Mendeley helps you to discover research relevant for your work.