Reasoning with Inconsistencies in Propositional Peer-to-Peer Inference Systems
نویسندگان
چکیده
In a peer-to-peer inference system, there is no centralized control or hierarchical organization: each peer is equivalent in functionality and cooperates with other peers in order to solve a collective reasoning task. Since peer theories model possibly different viewpoints, even if each local theory is consistent, the global theory may be inconsistent. We exhibit a distributed algorithm detecting inconsistencies in a fully decentralized setting. We provide a fully distributed reasoning algorithm, which computes only well-founded consequences of a formula, i.e., with a consistent set of support.
منابع مشابه
Gestion décentralisée de données en DL-LITE
This paper provides a decentralized data model and associated algorithms for peer data management systems (PDMSs) based on the DL-LITER description logic. That logic is a fragment of the forthcoming W3C recommendation for the Semantic Web : OWL2. Our approach relies on reducing query reformulation and consistency checking for DL-LITER into reasoning in propositional logic. This enables a straig...
متن کاملDL-LITER in the Light of Propositional Logic for Decentralized Data Management
This paper provides a decentralized data model and associated algorithms for peer data management systems (PDMS) based on the DL-LITER description logic. Our approach relies on reducing query reformulation and consistency checking for DL-LITER into reasoning in propositional logic. This enables a straightforward deployment of DLLITER PDMSs on top of SomeWhere, a scalable propositional peer-to-p...
متن کاملScalability Study of Peer-to-Peer Consequence Finding
In peer-to-peer inference systems, each peer can reason locally but also solicit some of its acquaintances, sharing part of its vocabulary. This paper studies both theoretically and experimentally the problem of computing proper prime implicates for propositional peer-to-peer systems, the global theory (union of all peer theories) of which is not known (as opposed to partition-based reasoning).
متن کاملDistributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peerto-peer inference systems is that the...
متن کاملCalcul de conséquences dans un système d’inférence pair-à-pair propositionnel Consequence Finding in a Propositional Peer-to-peer Inference System
In this paper, we study consequence finding in propositional peer-to-peer inference systems (P2PISs) with directed mappings. In those systems, a mapping from a peer to another specifies some knowledge that the former peer has to observe and the knowledge it must notify to the latter peer if the observed knowledge is satisfied. Such new P2PISs can model many real distributed applications and the...
متن کامل