In this paper, we examine an argument-based semantics called semi-stable semantics.
Semi-stable semantics is quite close to traditional stable semantics in the sense that every …

In this article, we examine an argument-based semantics called semi-stable semantics.
Semi-stable semantics is quite close to traditional stable semantics in the sense that every …

The paper presents a focused survey about the presence and the use of the concept of
“preferences” in Artificial Intelligence. Preferences are a central concept for decision making …

We investigate the notion of classical negation from a non-classical perspective. In
particular, one aim is to determine what classical negation amounts to in a paracomplete …

Abstract Paradefinite ('beyond the definite') logics are logics that can be used for handling
contradictory or partial information. As such, paradefinite logics should be both …

In two recent articles, Norihiro Kamide introduces unusual variants of Nelson's
paraconsistent logic and its classical extension. Kamide's systems, IP and CP, are unusual …

Three-valued matrices provide the simplest semantic framework for introducing
paraconsistent logics. This paper is a comprehensive study of the main properties of …

The present note contains a critical discussion of the methodology of paraconsistent logic in
general and “the central optimisation problem of paraconsistent logics” in particular. It is …

This chapter provides the reader with a presentation of preference modelling fundamental
notions as well as some recent results in this field. Preference modelling is an inevitable …

Paraconsistent logics are specially tailored to deal with inconsistency, while fuzzy logics
primarily deal with graded truth and vagueness. Aiming to find logics that can handle …