Results 1 
3 of
3
Paraconsistent knowledge bases and manyvalued logic
 International Baltic Conference on Databases and Information Systems, Volume
, 2002
"... Abstract Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge bases. We present a paraconsistent manyvalued logic with a simple and new semantics for the logical operators. In particular we compare our approach with work based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. 1.
SupraLogic: Using Transfinite Type Theory with Type Variables for Paraconsistency
"... Abstract. We define the paraconsistent supralogic Pσ by a typeshift from the booleans o of propositional logic Po to the suprabooleans σ of the propositional type logic P obtained as the propositional fragment of the transfinite type theory Q defined by Peter Andrews (NorthHolland Studies in Log ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We define the paraconsistent supralogic Pσ by a typeshift from the booleans o of propositional logic Po to the suprabooleans σ of the propositional type logic P obtained as the propositional fragment of the transfinite type theory Q defined by Peter Andrews (NorthHolland Studies in Logic 1965) as a classical foundation of mathematics. The supralogic is in a sense a propositional logic only, but since there is an infinite number of suprabooleans and arithmetical operations are available for this and other types, virtually anything can be specified. The supralogic is a generalization of ̷Lukasiewicz’s threevalued logic, with the intermediate value duplicated many times and ordered such that none of the copies of this value imply other ones, but it differs from ̷Lukasiewicz’s manyvalued logics as well as from logics based on bilattices (the latter have additional designated truth values). There are several automated theorem provers for classical higher order logic and it should be possible to modify these to our needs.
Nominalization in Intensional Type Theory
"... Oxford English Dictionary: By nominalization we understand the process of converting a word or phrase into a noun Nominalization is important for natural language processing “The apple is red and red is a colour” ..."
Abstract
 Add to MetaCart
Oxford English Dictionary: By nominalization we understand the process of converting a word or phrase into a noun Nominalization is important for natural language processing “The apple is red and red is a colour”