In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
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 reasoning in k...
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir