Aggregates provide a concise way to express complex knowledge. The problem of selecting
an appropriate formalization of aggregates for answer set programming (ASP) remains …

Abstract Approximation Fixpoint Theory (AFT) is an algebraic framework for studying
fixpoints of possibly nonmonotone lattice operators, and thus extends the fixpoint theory of …

This paper introduces the sequential composition of answer set programs. On the semantic
side, we show that the immediate consequence operator of a program can be represented …

We define a novel, extensional, three-valued semantics for higher-order logic programs with
negation. The new semantics is based on interpreting the types of the source language as …

Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for
studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics …

Active integrity constraints (AICs) constitute a formalism to associate with a database not just
the constraints it should adhere to, but also how to fix the database in case one or more of …

Approximation fixpoint theory (AFT) is an algebraic study of fixpoints of lattice operators that
unifies various knowledge representation formalisms. In AFT, stratification of operators has …

Neural-symbolic integration aims to combine the connectionist subsymbolic with the logical
symbolic approach to artificial intelligence. In this paper, we first define the answer set …

Approximation fixpoint theory (AFT) constitutes an abstract and general algebraic framework
for studying the semantics of nonmonotonic logics. It provides a unifying study of the …

Conditional independence is a crucial concept supporting adequate modelling and efficient
reasoning in probabilistics. In knowledge representation, the idea of conditional …