The concept of a stable model provided a declarative semantics for Prolog programs with
negation as failure and became a starting point for the development of answer set …

Equilibrium logic is a general purpose nonmonotonic reasoning formalism closely aligned
with answer set programming (ASP). In particular it provides a logical foundation for ASP as …

Logic programs and are strongly equivalent if, given any program $ P\cup RQ\cup R $ are
equivalent (that is, have the same answer sets). Strong equivalence is convenient for the …

In this survey, we present an overview on (Modal) Temporal Logic Programming in view of
its application to Knowledge Representation and Declarative Problem Solving. The syntax of …

The definition of a stable model has provided a declarative semantics for Prolog programs
with negation as failure and has led to the development of answer set programming. In this …

In recent research on nonmonotonic logic programming, repeatedly strong equivalence of
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …

This paper is a contribution to the research on dynamics in assumption-based
argumentation (ABA). We investigate situations where a given knowledge base undergoes …

The notion of forgetting, also known as variable elimination, has been investigated
extensively in the context of classical logic, but less so in (nonmonotonic) logic programming …

We consider the simplification of logic programs under the stable-model semantics, with
respect to the notions of strong and uniform equivalence between logic programs …

In recent research on nonmonotonic logic programming, repeatedly strong equivalence of
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …