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.
The Hardness of Revising Defeasible Preferences
OLIVIERI, FRANCESCO;SCANNAPIECO, SIMONE;CRISTANI, Matteo
2014-01-01
Abstract
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
the hardness of revising.pdf
solo utenti autorizzati
Descrizione: Final version
Tipologia:
Versione dell'editore
Licenza:
Accesso ristretto
Dimensione
196.28 kB
Formato
Adobe PDF
|
196.28 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.