On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Possibilistic Merging and Distance-Based Fusion of Propositional Information
Annals of Mathematics and 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
Updating Extended Logic Programs through Abduction
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Coordination in answer set programming
ACM Transactions on Computational Logic (TOCL)
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A preference-based framework for updating logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Updating action domain descriptions
Artificial Intelligence
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 paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P 1 , ..., P n , the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P 0 that are closest to the models of programs P 1 , ..., P n . P 0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the mergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.