Published: 2010 August
Buchtitel: Proceedings of the 19th European Conference on Artificial Intelligence
Verlag: ECAI 2010
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem becomes decidable. On the one hand, we abstract from the actual execution sequences of a non-terminating program by considering infinite sequences of actions defined by a B¨uchi automaton. On the other hand, we assume that the logic underlying our action formalism is a decidable description logic rather than full first-order predicate logic.
Weitere Informationen unter: Link