Answer set programming (ASP) is a form of declarative programming oriented towards
difficult search problems. As an outgrowth of research on the use of nonmonotonic …

This paper defines the syntax and semantics of the input language of the ASP grounder
gringo. The definition covers several constructs that were not discussed in earlier work on …

LP MLN is a recently introduced formalism that extends answer set programs by adopting
the log-linear weight scheme of Markov Logic. This paper investigates the relationships …

Knowledge Representation and Reasoning is a central, longstanding, and active area of
Artificial Intelligence. Over the years it has evolved significantly; more recently it has been …

We provide a comprehensive elaboration of the theoretical foundations of variable
instantiation, or grounding, in Answer Set Programming (ASP). Building on the semantics of …

The paper introduces an extension of the original Answer Set Prolog (ASP) by several set
constructs including aggregates, defined as functions on sets. The new language, called A …

We propose a new temporal extension of the logic of Hereand-There (HT) and its equilibria
obtained by combining it with dynamic logic over (linear) traces. Unlike previous temporal …

Two knowledge bases are strongly equivalent if and only if they are mutually
interchangeable in arbitrary contexts. This notion is of high interest for any logical formalism …

Abstract Answer Set Programming (ASP) has become a popular and widespread paradigm
for practical Knowledge Representation thanks to its expressiveness and the available …

We argue that turning a logic program into a set of completed definitions can be sometimes
thought of as the “reverse engineering” process of generating a set of conditions that could …