Results 151 to 160 of about 812 (177)
Some of the next articles are maybe not open access.
Paraconsistent Computation Tree Logic
New Generation Computing, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ken Kaneiwa, Norihiro Kamide
openaire +2 more sources
Reasoning in Paraconsistent Logics
1991Databases and knowledge bases could be inconsistent in many ways. For example, if a programmer is constructing an expert system ES relating to a domain D,he does so by consulting several experts (say n in number) in the field D. From each expert d i , 1 ≤ i ≤ n, he obtains some information, and this may be represented in logic as a collection of ...
James J. Lu +3 more
openaire +1 more source
Paraconsistent logics and applications
4th International Workshop on Soft Computing Applications, 2010In this expository paper we discuss some applications of paraconsistent annotated logics. They have the capability of manipulating concepts like fuzziness, inconsistency, and paracompleteness in a non-trivial manner. Such systems are new and they were discovered recently at the end of last century.
openaire +1 more source
Annotated Paraconsistent Logic
2009This paper presents a general view from the Two-Valued Annotated Paraconsistent Logic – 2vAPL to the Four-Valued Annotated Paraconsistent Logic – 4vAPL. The purpose to expand 2vAPL to 4vAPL is to enable the insertion of opinions from Experts in the knowledge base, so that the problems described approach their real condition, once ...
Helga Gonzaga Martins +4 more
openaire +1 more source
2003
According to the standard definition, a logic is said to be paraconsistent if it fails the (so-called) rule of ex falso: i.e., α, ¬α ∀ β. Thus, paraconsistency captures an important sense in which a logic is inconsistency-tolerant, namely when arbitrary inference is prohibited in the presence of inconsistencies.
Philippe Besnard, Paul Wong
openaire +1 more source
According to the standard definition, a logic is said to be paraconsistent if it fails the (so-called) rule of ex falso: i.e., α, ¬α ∀ β. Thus, paraconsistency captures an important sense in which a logic is inconsistency-tolerant, namely when arbitrary inference is prohibited in the presence of inconsistencies.
Philippe Besnard, Paul Wong
openaire +1 more source
A Hierarchy of Classical and Paraconsistent Logics
Journal of Philosophical Logic, 2019There is a consensual agreement in abstract logic that a logic is a pair of objects (in most times logicians accept, in the Tarskian tradition, that a consequence relation is defined between sets of formulas and formulas). To determine whether two logics are, or at least can be viewed as, identicals is a typical inquiry, usually, in the domains of ...
Eduardo Alejandro Barrio +2 more
openaire +2 more sources
Logical Weak Completions of Paraconsistent Logics
Journal of Logic and Computation, 2008Let P be an arbitrary theory and let X be any given logic. Let M be a set of atoms. We say that M is a X-stable model of P if M is a classical model of P and P∪¬M~ proves in logic X all atoms in M, this is denoted by P∪¬M~ ⊩xM. We prove that being an X-stable model is an invariant property for disjunctive programmes under a large class of logics.
Mauricio Javier Osorio Galindo +2 more
openaire +1 more source
A reasoning method for a paraconsistent logic
Studia Logica, 1993The recognition of the importance of paraconsistency for the study of the problem of modelling and automatizing the reasoning required to produce a glimmer of intelligent behavior on machines appeared in several previous works of the authors. This paper presents a proof method for automation of reasoning in the known paraconsistent predicate calculus \(
Arthur Buchsbaum, Tarcisio H. C. Pequeno
openaire +2 more sources
Paraconsistent Logic, Evidence, and Justification
Studia Logica, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A paraconsistent extension of Sylvan’s logic
Algebra and Logic, 2007Summary: We deal with Sylvan's logic \(CC_\omega\). It is proved that this logic is a conservative extension of positive intuitionistic logic. Moreover, a paraconsistent extension of Sylvan's logic is constructed, which is also a conservative extension of positive intuitionistic logic and has the property of being decidable.
openaire +1 more source