Computing modular paracoherent answer sets: Preliminary result

Answer Set Programming (ASP) is a well-established logic programming formalism. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Despite the non-existence of answer sets for some ASP programs can be a modeling feature, it turns out to be a weakness in many other cases, and especially for query answering. Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent logic programs, with the result of increasing the range of applications of ASP. State of the art implementations of paracoherent ASP adopt the semi-stable and the semi-equilibrium models semantics, but cannot compute split semi-equilibrium semantics, also known as modular paracoherent semantics, that discards undesirable semi-equilibrium models. In this paper, we introduce and discuss a first approach for the computation of modular paracoherent answer sets.