The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Fusion of multi-agent preference orderings
Fuzzy Sets and Systems
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
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)
mCP nets: representing and reasoning with preferences of multiple agents
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Preference revision via declarative debugging
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
On Preferring and Inspecting Abductive Models
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Xsb: Extending prolog with tabled logic programming
Theory and Practice of Logic Programming - Prolog Systems
| Hi-index | 0.00 |
This paper proposes a method allowing an agent to perform in a socially fair way by considering other agents’ preferences. Such a balanced action selection process is based on declarative diagnosis, which enables the removal of contradictions arising as all agents’ preferences are confronted within the deciding agent. Agents can be negatively affected when some of their preferences are not respected for the sake of a global compromise. The set of preferences to be yielded by agents in order to remove all contradictions in a balanced way (i.e. the diagnosis that better manages how each agent is to be affected) is determined by minimising a cost function computed over application independent features. By respecting the resulting non-contradictory preferences set, the deciding agent acts cooperatively.