ParaLog e: a paraconsistent evidential logic programming language

Avila, Braulio C.; Abe, Jair Minoro; Prado, J.P. de Almeida

doi:10.1109/sccc.1997.636815

Cited by 11 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a case study we consider a small knowledge base in the domain of medicine, previously used in a very different logic programming setting [8]. Originally the knowledge base was investigated by N. C. A. da Costa and V. S. Subrahmanian.…”

Section: A Case Studymentioning

confidence: 99%

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: A Case Studymentioning

confidence: 99%

A Paraconsistent Higher Order Logic

Villadsen

2004

Artificial Intelligence and Symbolic Computation

View full text Add to dashboard Cite

show abstract

“…For this purpose, a paraconsistent inheritance reasoner was implemented in ParaLog e [3]. The reasoner, according to Touretzky's [35] terminology, may be classified as complex, since it is a system possessing the following characteristics: multiple inheritance, bipolarity, heterogeneity and non-monotonicity, that is, it allows multiple ascending links, positive and negative links, strict and defeasible links, and exceptions to property inheritance.…”

Section: Related Workmentioning

confidence: 99%

“…The work byÁvila et al [3] proposes an extension of the ParaLog [15] logic programming language, called Par-aLog e, allowing inconsistency to be handled directly. The development of the ParaLog e language is based on an annotated paraconsistent logic [1], infinitely valued, where the truth-values are members of…”

Section: Paraconsistent Inheritance Reasonermentioning

confidence: 99%

“…The paraconsistent frame inheritance network -frame network -of the paraconsistent reasoner is a tangled hierarchy 3 . That is, it allows frame data to possess multiple ascending frames, and thereby multiple inheritance.…”

Section: Inheritance Network Representationmentioning

confidence: 99%

“…That is, it allows frame data to possess multiple ascending frames, and thereby multiple inheritance. In this paper, ascending links between two frames may be: 3 The basic terminology adopted in this paper is the same as Touretzky's [35] 4 a kind of is . That is, for instance, a [0.9, 0.3] evidence represents that a frame A, generally, ako frame B, but with a 20% inconsistency/under-determinedness degree 5 .…”

Section: Inheritance Network Representationmentioning

confidence: 99%

See 2 more Smart Citations

Inconsistencies, exceptions and frame systems [knowledge representation]

Avila

Hembecker²

SCCC 2001. 21st International Conference of the Chilean Computer Science Society

Self Cite

View full text Add to dashboard Cite

Although there is no unified approach to the representation of knowledge, various schemes for the representation and storage of knowledge have been proposed. This work concentrates on the Frames approach. Frames are a scheme for the representation of knowledge which allows the description of complex objects. However, there is a gap between the knowledge represented by Frame Systems and the knowledge in the real world. Some Frame Systems have been designed in order to reduce this gap. Nevertheless, they do not deal with tasks such as exceptions and the inconsistency phenomenon adequately. A drawback which has been found in those systems is the lack of a formal semantic which deals with exceptions and inconsistency. In this work an inheritance reasoner has been implemented. It represents knowledge through paraconsistent frames and performs inferences over the tangled hierarchies based upon the degree of inconsistency/under-determinedness. Moreover, its main characteristic is that it does not eliminate, ab initio, contradictions. The inheritance reasoner has provided a more adequate treatment to exceptions and inconsistent information of Frame Systems with multiple inheritance.

show abstract

Introduction to Annotated Logics

Abe¹,

Akama²,

Nakamatsu³

2015

Intelligent Systems Reference Library

View full text Add to dashboard Cite

About this SeriesThe aim of this series is to publish a Reference Library, including novel advances and developments in all aspects of Intelligent Systems in an easily accessible and well structured form. The series includes reference works, handbooks, compendia, textbooks, well-structured monographs, dictionaries, and encyclopedias. It contains well integrated knowledge and current information in the field of Intelligent Systems. The series covers the theory, applications, and design methods of Intelligent Systems. Virtually all disciplines such as engineering, computer science, avionics, business, e-commerce, environment, healthcare, physics and life science are included.More information about this series at

show abstract

ParaLog e: a paraconsistent evidential logic programming language

Cited by 11 publications

References 8 publications

A Paraconsistent Higher Order Logic

A Paraconsistent Higher Order Logic

Inconsistencies, exceptions and frame systems [knowledge representation]

Introduction to Annotated Logics

Contact Info

Product

Resources

About