Answer set programming is a form of declarative programming that can be used to elegantly
model various systems. When the available knowledge about these systems is imperfect …

Logic programs with ordered disjunction (or LPODs) have shown to be a flexible
specification language able to model and reason about preferences in a natural way …

Ordered disjunctions have been introduced as a simple, yet expressive approach for
representing preferential knowledge by means of logic programs. The semantics for the …

In this paper we consider a logical treatment for the ordered disjunction operator×
introduced by Brewka, Niemelä and Syrjänen in their Logic Programs with Ordered …

In case intelligent agents get new knowledge and this knowledge must be added or updated
to their knowledge base, it is important to avoid inconsistencies. Currently there are several …

In this paper, we define a class of nested logic programs, called Nested Logic Programs with
Ordered Disjunction (LPODs+), which makes it possible to specify conditional (qualitative) …

This paper describes a methodology based on Answer Set Programming (ASP) to work with
incomplete geographic data. Source geographic data which describes a risk zone is …

Argumentation theory is an alternative style of formalizing non-monotonic reasoning. It
seems, argumentation theory is a suitable framework for practical and uncertain reasoning …

The main purpose of argumentation theory is to study the fundamental mechanisms that
humans use in argumentation, and to explore ways to implement these mechanisms on …

In this paper, we present a general schema for defining new update semantics. This schema
takes as input any basic logic programming semantics, such as the stable semantics, the p …