Showing papers by "Ofer Arieli published in 1996"
••
TL;DR: This paper develops proof systems, which correspond to bilattice in an essential way, and introduces the notion of logical bilattices, which can be used for efficient inferences from possibly inconsistent data.
Abstract: The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. The outcome are paraconsistent logics with a lot of desirable properties.
A preliminary version of this paper appears in Arieli and Avron (1994).
272 citations
••
21 Sep 1996TL;DR: A four-valued approach for recovering consistent data from inconsistent set of assertions for a common family of knowledge-bases is presented and an efficient algorithm for doing so automaticly is provided.
Abstract: We present a four-valued approach for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing so automaticly. This method is particularly useful for making model-based diagnoses.
7 citations
••
16 Nov 1996TL;DR: The authors present a mechanism for recovering consistent data from an inconsistent set of assertions for a common family of knowledge bases and provide an efficient algorithm for doing so automatically.
Abstract: The authors present a mechanism for recovering consistent data from an inconsistent set of assertions. For a common family of knowledge bases they also provide an efficient algorithm for doing so automatically. This method is nonmonotonic and paraconsistent. It is particularly useful for making diagnoses on faulty devices.
4 citations