Modularity in logic programming
Proceedings of the eleventh international conference on Logic programming
Foundations of logic programming
Principles of knowledge representation
Compositionality of normal open logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Declarative problem-solving in DLV
Logic-based artificial intelligence
Answer set programming and plan generation
Artificial Intelligence
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Arbitration (or How to Merge 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
Extending Answer Sets for Logic Programming Agents
Annals of Mathematics and Artificial Intelligence
Logical foundations of negotiation: outcome, concession and adaptation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constructing consensus logic programs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
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
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Using ASP for knowledge management with user authorization
Data & Knowledge Engineering
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
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This article studies a semantics of multiple logic programs, and synthesizes a program having such a collective semantics. More precisely, the following two problems are considered: given two logic programs P1 and P2, which have the collections of answer sets AS(P1) and AS(P2), respectively; (i) find a program Q which has the set of answer sets such that AS(Q) = AS(P1) ∪ AS(P2); (ii) find a program R which has the set of answer sets such that AS(R) = AS(P1) ∩ AS(P2). A program Q satisfying the condition (i) is called generous coordination of P1 and P2; and R satisfying (ii) is called rigorous coordination of P1 and P2. Generous coordination retains all of the answer sets of each program, but permits the introduction of additional answer sets of the other program. By contrast, rigorous coordination forces each program to give up some answer sets, but the result remains within the original answer sets for each program. Coordination provides a program that reflects the meaning of two or more programs. We provide methods for constructing these two types of coordination and address its application to logic-based multi-agent systems.