A unifying view for logic programming with non-monotonic reasoning
Theoretical Computer Science
Compositionality of normal open logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Disjunctive logic programs with inheritance
Proceedings of the 1999 international conference on Logic programming
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
Coordination between logical agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Coordination in answer set programming
ACM Transactions on Computational Logic (TOCL)
Constructing consensus logic programs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
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
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. Given two programs P1 and P2, which have the sets of answer sets AS(P1) and AS(P2), respectively; find a program Q which has answer sets as minimal sets S∪ T for S from AS(P1) and T from AS(P2). The program Q combines answer sets of P1 and P2, and provides a compositional semantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.