Linear resolution for consequence finding
Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Description Logics: Directed Domain Correspondences in Federated Information Sources
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Notes on refinement, interpolation and uniformity
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The Piazza peer data management project
ACM SIGMOD Record
Learning to match ontologies on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
Ontology mapping: the state of the art
The Knowledge Engineering Review
Semantic integration: a survey of ontology-based approaches
ACM SIGMOD Record
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
Semantic-integration research in the database community
AI Magazine - Special issue on semantic integration
Just the right amount: extracting modules from ontologies
Proceedings of the 16th international conference on World Wide Web
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
A probabilistic trust model for semantic peer to peer systems
DaMaP '08 Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
WebContent: efficient P2P Warehousing of web data
Proceedings of the VLDB Endowment
Reasoning with Inconsistencies in Propositional Peer-to-Peer Inference Systems
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Distributed reasoning in a peer-to-peer setting: application to the semantic web
Journal of Artificial Intelligence Research
A logical framework for modularity of ontologies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conservative extensions in expressive description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Consequence-finding based on ordered linear resolution
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Scalability study of peer-to-peer consequence finding
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Aspects of distributed and modular ontology reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
DL-LITER in the light of propositional logic for decentralized data management
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Journal on data semantics VIII
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
A modularity approach for a fragment of ALC
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Inconsistency tolerance in P2P data integration: an epistemic logic approach
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Enabling semantic web communities with DBin: an overview
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
DRAGO: distributed reasoning architecture for the semantic web
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
A survey of schema-based matching approaches
Journal on Data Semantics IV
Design of a scalable reasoning engine for distributed, real-time and embedded systems
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Hi-index | 0.00 |
This paper points out that the notion of non-conservative extension of a knowledge base (KB) is important to the distributed logical setting of peer-to-peer inference systems (P2PIS), a.k.a. peer-to-peer semantic systems. It is useful to a peer in order to detect/prevent that a P2PIS corrupts (part of) its knowledge or to learn more about its own application domain from the P2PIS. That notion is all the more important since it has connections with the privacy of a peer within a P2PIS and with the quality of service provided by a P2PIS. We therefore study the following tightly related problems from both the theoretical and decentralized algorithmic perspectives: (i) deciding whether a P2PIS is a conservative extension of a given peer and (ii) computing the witnesses to the corruption of a given peer's KB within a P2PIS so that we can forbid it. We consider here scalable P2PISs that have already proved useful to Artificial Intelligence and DataBases.