19 Results Found

This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main propert...

This study presents a new Model Predictive Controller (MPC), built with algorithms based on Paraconsistent Annotated Logic (PAL), with application examples in the excitation control of a synchronous generator. PAL is a non-classical evidential and pr...

Broilers are particularly sensitive to heat stress, which can impair growth, and lower conversion efficiency and survival rates. Under a climate change scenario, maintaining optimal thermal conditions within broiler houses becomes more complex and en...

A logic is called explosive if its consequence relation validates the so-called principle of ex contradictione sequitur quodlibet. A logic is called paraconsistent so long as it is not explosive. Sette’s calculus $P^1$ is widely recognize...

Paraconsistent Annotated Logic (PAL) is a type of non-classical logic based on concepts that allow, under certain conditions, for one to accept contradictions without invalidating conclusions. The Paraconsistent Artificial Neural Cell of Learning (lP...

Logics of Formal Inconsistency ($LFI$ for short) are a class of paraconsistent logics that validate the principle of gentle explosion, meaning that any formula can be derived from the set of formulas: $\circ \alpha$, $\alpha$ and $\sim \alpha$. A unique...

This paper represents the first steps towards constructing a paraconsistent theory of probability based on the Logics of Formal Inconsistency (LFIs). We show that LFIs encode very naturally an extension of the notion of probability able to express so...

Dung’s abstract argumentation framework is a popular formalism in formal argumentation. The present work develops paraconsistent labeling semantics for abstract argumentation such that the incomplete and inconsistent information can be expresse...

The logic sqŁ^* is closely related to complex fuzzy sets. In this paper, we continue our study on sqŁ^* by establishing a system that includes all formulas with values $\mathbf{0}$ in sqŁ^*. This system has paraconsistent formulas within sqŁ^*....

Decision-making regarding maintenance planning has become increasingly critical. In view of the need for more assertive decisions, methods, and tools based on failure analysis, performance indicators, and risk analysis have obtained great visibility....

In this paper, we consider some paraconsistent calculi in a Hilbert-style formulation with the rule of detachment as the sole rule of interference. Each calculus will be expected to contain all axiom schemas of the positive fragment of classical prop...

This work contextualizes the possibility of deriving a unifying artificial intelligence framework by walking in the footsteps of General, Explainable, and Verified Artificial Intelligence (GEVAI): by considering explainability not only at the level o...

Non-Tarskian interpretations of many-valued logics have been widely explored in the logic literature. The development of non-tarskian conceptions of logical consequence set the theoretical foundations for rediscovering well-known (Tarskian) many-valu...

José Morgado introduced in 1962 a novel notion of hyperlattices, which he called reticuloides. In his master’s thesis submitted in 1971 (under the supervision of Newton da Costa), Antonio M. Sette introduced a new class of implicative hy...

In this paper, we propose Kripke-style models for the logics of evidence and truth $LE{T}_J$ and $LE{T}_F$. These logics extend, respectively, Nelson’s logic $N4$ and the logic of first-degree entailment ($FDE$) with a classicality operator ∘ that recovers c...

This paper explores the use of paraconsistent analysis for assessing neural networks from an explainable AI perspective. This is an early exploration paper aiming to understand whether paraconsistent analysis can be applied for understanding neural n...

There are two probabilistic algebras: one for classical probability and the other for quantum mechanics. Naturally, it is the relation to the object that decides, as in the case of logic, which algebra is to be used. From a paraconsistent multivalued...

Background: Cargo theft represents a persistent challenge to last-mile logistics in the peripheral regions of São Paulo, Brazil, compromising transportation security and increasing operational costs. These high-crime areas disrupt supply chain...

The philosophy of AI currently comprises the core of Philosophy and Computing. Fascinating ideas include: B. Goertzel states that humans use paraconsistent logic, which robots should follow; S. Thaler’s discovery engines (DABUS), which are at t...