Verifying Properties of Infinite Sequences of Description Logic Actions

Franz BaaderFranz Baader, Hongkai LiuHongkai Liu, Anees ul MehdiAnees ul Mehdi

Download

Franz Baader, Hongkai Liu, Anees ul Mehdi
Verifying Properties of Infinite Sequences of Description Logic Actions
In Helder Coelho and Rudi Studer and Michael Wooldridge, eds., Proceedings of the 19th European Conference on Artificial Intelligence (ECAI10), volume 215 of Frontiers in Artificial Intelligence and Applications, 53-58, 2010. IOS Press

Details
Bibtex

KurzfassungAbstract
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 Buechi 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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BaLiMe-ECAI10,
  author = {Franz {Baader} and Hongkai {Liu} and Anees ul {Mehdi}},
  booktitle = {Proceedings of the 19th European Conference on Artificial Intelligence ({ECAI10})},
  editor = {Helder {Coelho} and Rudi {Studer} and Michael {Wooldridge}},
  pages = {53--58},
  publisher = {IOS Press},
  series = {Frontiers in Artificial Intelligence and Applications},
  title = {Verifying Properties of Infinite Sequences of Description Logic Actions},
  volume = {215},
  year = {2010},
}