Dealing with incompleteness and inconsistency in P2P deductive databases

摘要: This paper proposes a logic framework for modeling the interaction among incomplete and inconsistent deductive databases in P2P environment. Each peer joining system provides or imports data from its neighbors by using set of mapping rules, i.e. semantic correspondences to peers belonging same By as soon it enters system, can participate access all available neighborhood, through neighborhood becomes accessible other system. Two different types rules are defined: first type allowing import maximal sets atoms second minimal source target peers. In proposed setting, each be thought resource used either enrich (integrate) knowledge fix (repair) knowledge. The declarative semantics is defined terms preferred weak models. An equivalent alternative characterization model semantics, prioritized programs, also introduced. presents preliminary results about complexity queries.