scispace - formally typeset
Search or ask a question
Topic

Paraconsistent logic

About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.


Papers
More filters
Book ChapterDOI
20 Sep 2004
TL;DR: This paper introduces how to apply EVALPSN to discrete event control with taking an example called Cat and Mouse, and shows that such a discrete event controlled by a paraconsistent logic program can be easily formalized in EVsN and implemented.
Abstract: We have developed a paraconsistent logic program called an Extended Vector Annotated Logic Program with Strong Negation (abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction, and applied it to safety verification and control such as railway interlocking safety verification, traffic signal control etc.. In this paper, we introduce how to apply EVALPSN to discrete event control with taking an example called Cat and Mouse. Generally, event control can be represented as deontic rules such as it is forbidden for both the cat and the mouse to occupy the same room simultaneously, and the control must deal with contradiction to avoid unexpected system states. We show that such a discrete event control can be easily formalized in EVALPSN and implemented.

9 citations

Journal ArticleDOI
TL;DR: In this article, some paraconsistent and temporal description logics are studied based on an embedding-based proof method and some theorems for embedding PALC, XALC and BALCl into ALC are proved in a uniform way.
Abstract: In this article, some paraconsistent and temporal description logics are studied based on an embedding-based proof method. A new paraconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraconsistent negation. Two temporal description logics, XALC and BALCl, are introduced by combining and modifying ALC and Prior’s tomorrow tense logic. XALC has the next-time operator, and BALCl has some restricted versions of the next-time, any-time and some-time operators, in which the time domain is bounded by a positive integer l. Some theorems for embedding PALC, XALC and BALCl into ALC are proved in a uniform way, and PALC, XALC and BALCl are shown to be decidable. Three tableau calculi for PALC, XALC and BALCl are introduced, and the completeness theorems for these calculi are proved.

9 citations

Book ChapterDOI
01 Jan 2015
TL;DR: The catuṣkoṭi principle of Indian logic has been applied in different ways at different times and by different people as discussed by the authors, and the tools of modern non-classical logic show exactly how to do this.
Abstract: The catuṣkoṭi (Greek: tetralemma; English: four corners) is a venerable principle of Indian logic, which has been central to important aspects of reasoning in the Buddhist tradition. What, exactly, it is, and how it is applied, are, however, moot—though one thing that does seem clear is that it has been applied in different ways at different times and by different people. Of course, Indian logicians did not incorporate the various interpretations of the principle in anything like a theory of validity in the modern Western sense; but the tools of modern non-classical logic show exactly how to do this. The tools are those of the paraconsistent logic of First Degree Entailment and some of its modifications.

9 citations

Journal ArticleDOI
TL;DR: This paper handles properties of (non-monotonic) consequence operations for discursive logic, i.e. paraconsistency and enthymematycity, which are investigated in formal aspects of scientific discourse.
Abstract: Both logic and philosophy of science investigate formal aspects of scientific discourse, i.e. properties of (non-monotonic) consequence operations for discursive logic. In the present paper we handle two of them: paraconsistency and enthymematycity.

9 citations


Network Information
Related Topics (5)
Axiom
11K papers, 257.9K citations
80% related
Logic programming
11.1K papers, 274.2K citations
79% related
Metaphysics
14.8K papers, 235.4K citations
77% related
Philosophy of science
15.4K papers, 361.5K citations
77% related
Class (set theory)
17.4K papers, 242K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202313
202255
202131
202036
201935
201847