The hardness of revising defeasible preferences


Autoria(s): Governatori, Guido; Olivieri, Francesco; Scannapieco, Simone; Cristani, Matteo
Contribuinte(s)

Bikakis, A

Fodor, P

Roman, D

Data(s)

2014

Resumo

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.

Identificador

http://eprints.qut.edu.au/88712/

Publicador

Springer

Relação

DOI:10.1007/978-3-319-09870-8_12

Governatori, Guido, Olivieri, Francesco, Scannapieco, Simone, & Cristani, Matteo (2014) The hardness of revising defeasible preferences. In Bikakis, A, Fodor, P, & Roman, D (Eds.) Rules on the Web: From Theory to Applications: 8th International Symposium, RuleML 2014, Co-located with the 21st European Conference on Artificial Intelligence, ECAI 2014 Proceedings [Lecture Notes in Computer Science, Volume 8620], 18 - 20 August, 2014, Czech Republic.

Fonte

School of Information Systems; Science & Engineering Faculty

Tipo

Conference Paper