We explore some links between abstract argumentation, logic and kernels in digraphs. Viewing argumentation frameworks as propositional theories in graph normal form, we observe that the stable semantics for argumentation can be given equivalently in terms of satisfaction and logical consequence in classical logic. We go on to show that the complete semantics can be formulated using Lukasiewicz ...

The Cai δ-equality of fuzzy sets corresponds to the Lukasiewicz t-norm. In this paper we study the notion of (∗, δ)-equality, a concept which generalizes the δ-equality to the case of the fuzzy set theory based on an arbitrary continuous t-norm ∗. We investigate the robustness of some fuzzy implication operators in terms of (∗, δ)-equality.

In this paper, we develop a duality for the varieties of a Lukasiewicz n + 1-valued modal system. This duality is an extension of Stone duality for modal algebras. Some logical consequences (such as completeness results, correspondence theory. . . ) are the derived and we propose some ideas for future research.

This paper presents an application of an optimized implementation of a probabilistic description logic defined by Giugno and Lukasiewicz [9] to the domain of image interpretation. This approach extends a description logic with so-called probabilistic constraints to allow for automated reasoning over formal ontologies in combination with probabilistic knowledge. We analyze the performance of cur...

In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobservable transitions where weights are taken from an idempotent semiring. In particular the (max/+), (min/+) or (max/min) dioid are considered. The proposed bisimulation is a natural extension of Milner’s well known weak bisimulation for untimed automata (i. e., weighted automata over the boolean se...

We explain Giles’s characterization of Lukasiewicz logic via a dialogue game combined with bets on results of experiments that may show dispersion. The game is generalized to other fuzzy logics and linked to recent results in proof theory. We argue that these results allow one to place t-norm based fuzzy logics in a common framework with supervaluation as a theory of vagueness.

In Artificial Intelligence, as well as in data base updating or in the design of intelligent agents, it is necessary the use of contradictory information. For that, it is useful to direct our attention to paraconsistent logics. The goal of the present survey is to offer an initial analysis on paraconsistency in some logics like Pac, RM3, Lukasiewicz, G ′ 3.

Methylammonium-mediated phase-evolution behavior of FA1-x MAx PbI3 mixed-organic-cation perovskite (MOCP) is studied. It is found that by simply enriching the MOCP precursor solutions with excess methylammonium cations, the MOCPs form via a dynamic composition-tuning process that is key to obtaining MOCP thin films with superior properties. This simple chemical approach addresses several key ch...

The aim of this work is to study a class of non-archimedean valued measures on MV-algebras. We call them hyperreal states and their definition naturally arise from (the uniform version of) Di Nola representation theorem for MV-algebras (cf [5, 6]): for any MV-algebra A = (A,⊕,¬,>,⊥) there exists a ultrafilter U on the cardinality of A such that A embeds into (∗[0, 1]U) Spec(A) (where as usual S...