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
Journal ArticleDOI
TL;DR: In this article, the main point of this paper is to show that even if it is formally possible to isolate the contradictions and to live with them, this cohabitation is neither desired by working scientists not desirable for the progress of science.
Abstract: Any inconsistent theory whose underlying logic is classical encompasses all the sentences of its own language. As it denies everything it asserts, it is useless for explaining or predicting anything. Nevertheless, paraconsistent logic has shown that it is possible to live with contradictions and still avoid the collapse of the theory. The main point of this paper is to show that even if it is formally possible to isolate the contradictions and to live with them, this cohabitation is neither desired by working scientists not desirable for the progress of science. Several cases from the recent history of physics and cosmology are analyzed.

1 citations

01 Jan 1989
TL;DR: This dissertation develops a model theory and a fixed point theory and study the declarative semantics of logic programming languages based on multivalued logics and paraconsistent logics, and studies the algebraic properties of the space of operators associated with (classical) general logic programs.
Abstract: The primary aim of this dissertation is to study the semantics of logic programming languages based on multivalued logics and paraconsistent logics. These are studied in two settings: in the first, a framework for logic programming based on a family of logics called annotated logics is proposed. Different special cases of this formalism yield methods for reasoning in the presence of (classical) inconsistency. We develop a model theory and a fixed point theory and thereby study the declarative semantics of such programs. We also develop procedures to process queries. In the second formalism, we assume that multivalued programs consist of sets of clauses each of which has an associated truth value. We then define a family of logics (and a family of logic programs based on these logics). The critical feature is that we do not commit ourselves to any specific definition of the "attenuation" function that describes how to "propagate" a truth value from the body of a clause to the head of the clause. This allows us to reason in the presence of uncertainty. Finally, we study the algebraic properties of the space of operators associated with (classical) general logic programs and later conduct a similar investigation for annotated logic programs.

1 citations

Journal Article
TL;DR: In this paper, the limitation of standard logic is analysed and various demands to logics proposed by the further development of artificial intelligence are discussed, and various kinds of non-standard logics that rise vigorously explore from different level or side on how to deal with contradiction and uncertainty, they are probing into the mathematics way of dialectical logic.
Abstract: Firstly,the limitation of standard logic is analysed in this paperVarious demands to logics proposed by the further development of artificial intelligence are discussedand it also proposed that various kinds of non-standard logics that rise vigorously explore from different level or side on how to deal with various kinds of contradiction and uncertainty,they are probing into the mathematics way of dialectical logicSecondly,the realization of dialectical logic mathematics research planning" Research outline of universal logics"put forward by the authors is introduced briefly,and the main point of" the standard proposition universal logics" set up under the guidance of the outline is also introducedThis logic system is pointed out that while forgiving various kinds of dialectical contradictions,the system have got rid of the logical contradiction effectivelyFinally,the world universal logic research status and the 2nd World Congress on Universal Logic are introduced in the article,hoping to bring everybody's attention

1 citations

Journal ArticleDOI
TL;DR: A generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic, is utilized to support disjunctive syllogism.
Abstract: The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the paraconsistent relational model is capable of representing incomplete and inconsistent data, we propose an algorithm to find QC model for inconsistent positive extended disjunctive deductive databases. We also provide the proof for the algorithm.

1 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