Results 131 to 140 of about 1,037 (173)
Some of the next articles are maybe not open access.

Negation and Paraconsistent Logics

Logica Universalis, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Soma Dutta, Mihir K. Chakraborty
openaire   +1 more source

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 Translations

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

Foundations of Paraconsistent Resolution

Fundamenta Informaticae, 2006
An extended first-order predicate sequent calculus PLK with two kinds of negation is introduced as a basis of a new resolution calculus PRC (paraconsistent resolution calculus) for handling the property of paraconsistency. Herbrand theorem, completeness theorem (with respect to a classical-like semantics) and cut-elimination theorem are proved for PLK.
openaire   +3 more sources

Paraconsistent argumentation schemes

Web Intelligence, 2016
Various types of everyday arguments are represented as argumentation schemes, originating from the Legal Argumentation literature. The recent achievements in this domain can be applied to multi-agent settings to enrich the paradigmatic aspects of communication and reasoning.
Barbara Dunin-Keplicz, Alina Strachocka
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

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   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy