Results 111 to 120 of about 152 (142)
Some of the next articles are maybe not open access.

Paraconsistent Logic

2002
A logic is paraconsistent if it does not validate the principle that from a pair of contradictory sentences, A and ∼A, everything follows, as most orthodox logics do. If a theory has a paraconsistent underlying logic, it may be inconsistent without being trivial (that is, entailing everything).
openaire   +2 more sources

Paraconsistent logics and applications

4th International Workshop on Soft Computing Applications, 2010
In 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

Paraconsistent Logic Programs

2002
We propose a framework which extends Antitonic Logic Programs [2] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Based on Fitting's ideas, this framework allows a precise definition of important operators found in logic programming such as explicit negation and the default negation. In particular,
João Alcântara   +2 more
openaire   +1 more source

Paraconsistent Logical Consequence

Journal of Applied Non-Classical Logics, 1998
ABSTRACT The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the ...
openaire   +1 more source

Logical Weak Completions of Paraconsistent Logics

Journal of Logic and Computation, 2008
Let 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.
M. Osorio Galindo   +2 more
openaire   +1 more source

Modal (Logic) Paraconsistency

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

Paraconsistent Classical Logic

2002
But the ambiguity will not trouble us, since the relata will always allow us to tell which relation is meant. We take it for granted that we are dealing with a standard sort of formal language1, and a standard recursive definition of truth-ina-model. Since the details of the language do not matter for our purposes, we will forgo specifying them.
openaire   +2 more sources

Annotated Paraconsistent Logic

2009
This 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 ...
Martins Helga Gonzaga   +4 more
openaire   +1 more source

Paraconsistent Logics: Preamble

2015
In this introductory chapter it is introduced some aspects of paraconsistent logics, such as its brief historical developments, some main systems and mention some applications. The chapter obviously does not cover many topics: moreover it is far from to be complete. In fact, the theme is now widespread and occupies a distinguished position in academia.
openaire   +1 more source

Paraconsistent Logic, Evidence, and Justification

Studia Logica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy