Verifying Properties of Infinite Sequences of Description Logic Actions

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 deOn 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

• Type: Conference
• Year: 2010
• Where: ECAI
• Authors: Franz Baader, Hongkai Liu, Anees ul Mehdi
• Keywords: Action Logic Programs, Artificial Intelligence, ECAI 2010, First-order Predicate Logic, Non-terminating Behaviour