Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...