Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...