In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer ...
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...