Preference revision via declarative debugging

Authors:
Pierangelo Dell’Acqua;Luís Moniz Pereira
Affiliations:
Department of Science and Technology – ITN, Linköping University, Norrköping, Sweden;Centro de Inteligência Artificial – CENTRIA, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal
Venue:
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Year:
2005

Citing 8
Cited 1

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Belief revision

Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Fusion of multi-agent preference orderings

Fuzzy Sets and Systems
Debugging by Diagnosing Assumptions

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
Abduction in well-founded semantics and generalized stable models via tabled dual programs

Theory and Practice of Logic Programming
mCP nets: representing and reasoning with preferences of multiple agents

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Preferring and updating in logic-based agents

INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support

Emergence of cooperation through mutual preference revision

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preference criteria are rarely static. Often they are subject to modification and aggregation. The resulting preference criteria may not satisfy the properties of the original ones and must therefore be revised. This paper investigates the problem of revising such preference criteria by means of declarative debugging techniques.