Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Preferred answer sets for extended logic programs
Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Alternating Fixpoint Theory for Logic Programs with Priority
CL '00 Proceedings of the First International Conference on Computational Logic
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Integrating and Querying P2P Deductive Databases
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Queries and updates in the coDB peer to peer database system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Inconsistency tolerance in P2P data integration: An epistemic logic approach
Information Systems
Consistent Data Integration in P2P Deductive Databases
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The semantics of consistency and trust in peer data exchange systems
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Modeling cooperation in P2P data management systems
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Query answering in peer-to-peer data exchange systems
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Restoring consistency in p2p deductive databases
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
| Hi-index | 0.00 |
This paper investigates the data exchange problem among distributed independent sources. It is based on previous works of the authors [11, 12, 14] in which a declarative semantics for P2P systems has been presented and a mechanism to set different degrees of reliability for neighbor peers has been provided. The basic semantics for P2P systems defines the concept of Maximal Weak Models (in [11, 12, 14] these models have been called Preferred Weak Models. In this paper we rename them and use the term Preferred for the subclass of Weak Model defined here) that represent scenarios in which maximal sets of facts not violating integrity constraints are imported into the peers [11, 12]. Previous priority mechanism defined in [14] is rigid in the sense that the preference between conflicting sets of atoms that a peer can import only depends on the priorities associated to the source peers at design time. In this paper we present a different framework that allows to select among different scenarios looking at the properties of data provided by the peers. The framework presented here allows to model concepts like "in the case of conflicting information, it is preferable to import data from the neighbor peer that can provide the maximum number of tuples" or "in the case of conflicting information, it is preferable to import data from the neighbor peer such that the sum of the values of an attribute is minimum" without selecting a-priori preferred peers. To enforce this preference mechanism we enrich the previous P2P framework with aggregate functions and present significant examples showing the flexibility of the new framework.