SHACL (SHape Constraint Language) is a W3C recommendation for validating graph-
based data against a set of constraints (called shapes). Importantly, SHACL allows to define …

The answer set semantics may assign a logic program to model, due to logical contradiction
or unstable negation, which is caused by cyclic dependency of an atom on its negation …

When Dung introduced his argumentation approach, he proved that it can be regarded as a
special form of logic programming with negation as failure. In fact, he showed that the …

We study the problem of reasoning from incoherent answer set programs, ie, from logic
programs that do not have an answer set due to cyclic dependencies of an atom from its …

Abstract Answer Set Programming (ASP) is a well-established formalism for nonmonotonic
reasoning. An ASP program can have no answer set due to cyclic default negation. In this …

Béziau developed the paraconsistent logic Z, which is definitionally equivalent to the modal
logic S 5, and gave an axiomatization of the logic Z: the system HZ. Omori and Waragai …

This paper briefly describes the objectives of the TREND (Toward Real Energy-efficient
Network Design) Network of Excellence of the European Commission 7 th Framework …

In this paper by considering answer set programming approach and some basic ideas from
possibilistic logic, we introduce a possibilistic disjunctive logic programming approach able …

Abstract Answer Set Programming (ASP) is a well-established formalism for nonmonotonic
reasoning. While incoherence, the non-existence of answer sets for some programs, is an …

Abstract Answer Set Programming (ASP) is a well-established paradigm for declarative
programming and nonmonotonic reasoning. ASP allows for flexible modeling using rules …