作者: Luciano Caroprese , Ester Zumpano
DOI: 10.1007/978-3-642-33362-0_13
关键词:
摘要: This paper proposes a logic framework for modeling the interaction among deductive databases and computing consistent answers to queries in P2P environment. As usual, data are exchanged peers by using logical rules, called mapping rules. The declarative semantics of system is defined terms weak models. Under this each peer uses its rules import minimal sets atoms allowing satisfy local integrity constraints. An equivalent alternative characterization model semantics, prioritized programs, also introduced computational complexity investigated.