Results 1  10
of
1,744
Maximally paraconsistent threevalued logics
 Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning (KR’10
, 2010
"... Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
it in the context of logics that are based on deterministic or nondeterministic threevalued matrices. We first show that most of the logics that are based on properly nondeterministic threevalued matrices are not maximally paraconsistent. Then we show that in contrast, in the deterministic case all the natural
Threevalued Logics for Inconsistency Handling
"... While threevalued paraconsistent logic is a valuable framework for reasoning under inconsistency, the corresponding basic inference relation is too cautious and fails in discriminating in a finegrained way the set of expected consequences of belief bases. To address both issues, we point out more ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
While threevalued paraconsistent logic is a valuable framework for reasoning under inconsistency, the corresponding basic inference relation is too cautious and fails in discriminating in a finegrained way the set of expected consequences of belief bases. To address both issues, we point out more
Maximal and premaximal paraconsistency in the framework of threevalued semantics
 STUDIA LOGICA,
, 2011
"... Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
it in the context of logics that are based on deterministic or nondeterministic threevalued matrices. We show that all reasonable paraconsistent logics based on threevalued deterministic matrices are maximal in our strong sense. This applies to practically all threevalued paraconsistent logics that have been
Ideal Paraconsistent Logics
, 2011
"... We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every threevalued paraconsistent lo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every threevalued paraconsistent
Gentzentype Refutation Systems for ThreeValued Logics ⋆
"... Abstract. While the purpose of a conventional proof calculus is to axiomatise the set of valid sentences of a given logic, a refutation system, or complementary calculus, is concerned with axiomatising the invalid sentences. Instead of exhaustively searching for counter models for some sentence, ref ..."
Abstract
 Add to MetaCart
logics that allow to embed wellknown threevalued logics relevant for AI and logic programming like that of Kleene, Łukasiewicz, Gödel, as well as threevalued paraconsistent logics. As an application of our calculus, we provide derived rules for Gödel’s threevalued logic, allowing to decide strong
On strong maximality of paraconsistent finitevalued logics.
 In Proc. 25th Ann. Symp. on Logic in Computer Science (LICS’10),
, 2010
"... AbstractMaximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible from classical logic. In this paper we introduce a new, strong notion of maximal paraconsistency, which is based on possible ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
to classical logic, and is not equivalent to any kvalued logic with k < n. On the other hand, we specify a natural condition that guarantees that a paraconsistent logic is contained in a logic in the class of threevalued paraconsistent logics, and show that all reasonably expressive logics in this class
1 Benemerita Universidad Atonoma de Puebla
"... Abstract We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show with the help of an answer set programming (ASP) tool called clasp, that C1 is robust with respect to certain three valued paraconsistent logics with some desirable proper ..."
Abstract
 Add to MetaCart
Abstract We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show with the help of an answer set programming (ASP) tool called clasp, that C1 is robust with respect to certain three valued paraconsistent logics with some de
Threevalued paraconsistent reasoning for Semantic Web agents
 Proceedings of KESAMSTA 2010, Part I, volume 6070 of LNAI
, 2010
"... Abstract. Description logics [1] refer to a family of formalisms concentrated around concepts, roles and individuals. They are used in many multiagent and semantic web applications as a foundation for specifying knowledge bases and reasoning about them. One of widely applied description logics is SH ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
is SHIQ [7,8]. In the current paper we address the problem of inconsistent knowledge. Inconsistencies may naturally appear in the considered application domains, for example as a result of fusing knowledge from distributed sources. We define three threevalued paraconsistent semantics for SHIQ, reflecting
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 446 (13 self)
 Add to MetaCart
those involving confidence factors. The classical twovalued and the Kripke/Kleene threevalued semantics become special cases, since the logics involved are natural sublogics of Belnap's logic, the logic given by the simplest bilattice. 1 Introduction Often useful information is spread over a
Exploration, normalization, and summaries of high density oligonucleotide array probe level data.
 Biostatistics,
, 2003
"... SUMMARY In this paper we report exploratory analyses of highdensity oligonucleotide array data from the Affymetrix GeneChip R system with the objective of improving upon currently used measures of gene expression. Our analyses make use of three data sets: a small experimental study consisting of f ..."
Abstract

Cited by 854 (33 self)
 Add to MetaCart
SUMMARY In this paper we report exploratory analyses of highdensity oligonucleotide array data from the Affymetrix GeneChip R system with the objective of improving upon currently used measures of gene expression. Our analyses make use of three data sets: a small experimental study consisting
Results 1  10
of
1,744