In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain value...
Sandeep Chintabathina, Michael Gelfond, Richard Wa...
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...