A Query Construct for Paraconsistent Databases

Bagai, Rajiv

doi:10.1007/978-1-4615-5209-3_4

Cited by 1 publication

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our logic is a generalization of Lukasiewicz's three-valued 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 [13,22,7,9,10,25] where the third value means "neither true nor false" and the fourth value means "both true and false" (and is designated as well).…”

Section: Overall Motivationmentioning

confidence: 99%

See 1 more Smart Citation

A Paraconsistent Higher Order Logic

Villadsen

2004

Artificial Intelligence and Symbolic Computation

View full text Add to dashboard Cite

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-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens.Many non-classical logics are, at the propositional level, funny toys which work quite good, but when one wants to extend them to higher levels to get a real logic that would enable one to do mathematics or other more sophisticated reasonings, sometimes dramatic troubles appear.

show abstract

Section: Overall Motivationmentioning

confidence: 99%

“…We present a paraconsistent higher order logic ∇ based on the (simply) typed λ-calculus [18,4]. Although it is a generalization of Lukasiewicz's three-valued logic the meaning of the logical operators is new, but with relations to logics based on bilattices [13,22,7,9,10,25].…”

Section: Introductionmentioning

confidence: 99%

A Paraconsistent Higher Order Logic

Villadsen

2004

Artificial Intelligence and Symbolic Computation

View full text Add to dashboard Cite

show abstract

A Query Construct for Paraconsistent Databases

Cited by 1 publication

References 7 publications

A Paraconsistent Higher Order Logic

A Paraconsistent Higher Order Logic

Contact Info

Product

Resources

About