ASP for reasoning about actions with an EL? knowledge base

In this paper we propose an approach based on Answer Set Programming (ASP) for reasoning about actions in a domain description including knowledge expressed in the low complexity description logic EL^⊥. We consider an action theory in which the state is a set of positive and negative assertions, that we represent through explicit negation. The action language allows for non-deterministic actions, and causal rules are introduced to deal with ramifications. We provide sufficient conditions under which action consistency can be guaranteed and we define a polynomial encoding of the action theory in ASP.