2014 | OriginalPaper | Buchkapitel
The Hardness of Revising Defeasible Preferences
verfasst von : Guido Governatori, Francesco Olivieri, Simone Scannapieco, Matteo Cristani
Erschienen in: Rules on the Web. From Theory to Applications
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.