This article surveys various complexity and expressiveness results on different forms of logic
programming. The main focus is on decidable forms of logic programming, in particular …

A novel logic program like language, weight constraint rules, is developed for answer set
programming purposes. It generalizes normal logic programs by allowing weight constraints …

This paper surveys various complexity results on different forms of logic programming. The
main focus is on decidable forms of logic programming, in particular propositional logic …

In this paper we present a graph representation of logic programs and default theories. We
show that many of the semantics proposed for logic programs with negation can be …

The integration of knowledge for multiple sources is an important aspect of automated
reasoning systems. When different knowledge bases are used to store knowledge provided …

In this paper we develop an algebraic framework for studying semantics of nonmonotonic
logics. Our approach is formulated in the language of lattices, bilattices, operators and …

We compare the expressive powers of three semantics for deductive databases and logic
programming: the 3-valued program completion semantics, the well-founded semantics, and …

We revisit the issue of epistemological and semantic foundations for autoepistemic and
default logics, two leading formalisms in nonmonotonic reasoning. We develop a general …

Dealing with contradiction Page 1 8. Dealing with contradiction As we've seen before, WFSX
is not defined for every program, ie some programs are contradictory and are given no …

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 …