Results 141 to 150 of about 247 (182)

Paraconsistent Logics and Translations

Synthese, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D'Ottaviano, Itala M. Loffredo, de A. Feitosa, Hércules   +1 more
openaire   +2 more sources

Paraconsistency in classical logic

Synthese, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabriele Pulcini, Achille C. Varzi
openaire   +3 more sources

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 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

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 F. L. Alcântara, Carlos Viegas Damásio, Luís Moniz Pereira   +2 more
openaire   +1 more source

Paraconsistent Computation Tree Logic

New Generation Computing, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ken Kaneiwa, Norihiro Kamide
openaire   +2 more sources

Reasoning in Paraconsistent Logics

1991
Databases 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, Lawrence J. Henschen, V. S. Subrahmanian, Newton C. A. da Costa   +3 more
openaire   +1 more source

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

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 ...
Helga Gonzaga Martins, Carlos Henrique Valério de Moraes, Claudio Inácio de Almeida Costa, Germano Lambert-Torres, Antônio Faria Neto   +4 more
openaire   +1 more source

Bisimilarity for paraconsistent description logics

Journal of Intelligent & Fuzzy Systems, 2016
We introduce comparisons w.r.t. information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. This notion is useful for concept learning in description logics when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons w.r.t.
Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc Thanh Nguyen 0001, Quang-Thuy Ha   +3 more
openaire   +3 more sources