Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Consistent query answering in databases
ACM SIGMOD Record
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Aspects of distributed and modular ontology reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
Inconsistency tolerance in P2P data integration: an epistemic logic approach
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Semantically correct query answers in the presence of null values
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Query translation between sources in peer-to-peer database sharing systems
International Journal of Knowledge Engineering and Data Mining
Automated and user involved data synchronization in collaborative e-health environments
Computers in Human Behavior
| Hi-index | 0.00 |
We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supplement or modify its own data source. The data exchange relationships between peers are specified by logical sentences called data exchange constraintsand trust relationships, which together determine how data is moved around (in order to keep them satisfied). This process determines virtual, alternative instances for a peer that can be specified as the models of an answer set program. The peer consistent answersto a query that are returned by a peer are those that are invariant under all these instances. The logic program can be used to compute peer consistent answers.