Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Multiagent Compromises, Joint Fixpoints, and Stable Models
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Logical foundations of negotiation: outcome, concession and adaptation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Coordination between logical agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Combining answer sets of nonmonotonic logic programs
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Coordination in answer set programming
ACM Transactions on Computational Logic (TOCL)
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Query-driven coordination of multiple answer sets
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Group decision making in multiagent systems with abduction
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper, we suppose an agent which has a knowledge base represented by a logic program under the answer set semantics. We then consider the following two problems: given two programs P1 and P2, which have the sets of answer sets AS(P1) and AS(P2), respectively; (i) find a program Q which has the answer sets as the minimal elements of {S ∩ T | S ∈ AS(P1) and T ∈ AS(P2)}; (ii) find a program R which has the answer sets as the maximal elements of the above set. A program Q satisfying (i) is called minimal consensus between P1 and P2; and R satisfying (ii) is called maximal consensus between P1 and P2. Minimal/maximal consensus extracts common beliefs that are included in an answer set of every program. Consensus provides a method of program development under a specification of constructing a program that reflects the meaning of two or more programs. In application, it contributes to a theory of building consensus in multi-agent systems.