Abstract Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted
in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing …

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 …

Equilibrium logic is a logical characterization of Answer Set Programming (ASP). We
introduce Deontic Equilibrium Logic with eXplicit negation (DELX), its extension for …

Abstraction is an important technique utilized by humans in model building and problem
solving, in order to figure out key elements and relevant details of a world of interest. This …

Recently, an answer-set programming (ASP) formalism of logic programing with the answer-
set semantics has been extended to the full first-order setting. Earlier an extension of first …

In the context of the emerging Semantic Web and the quest for a common logical framework
underpinning its architecture, the relation of rule-based languages such as Answer Set …

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 …

In temporal extensions of answer set programming (ASP) based on linear time, the behavior
of dynamic systems is captured by sequences of states. While this representation reflects …

Over the years, the stable-model semantics has gained a position of the correct (two-valued)
interpretation of default negation in programs. However, for programs with aggregates …

Abstract Temporal Here and There (THT) constitutes the logical foundations of Temporal
Equilibrium Logic. Nevertheless, it has never been studied in detail since results about …