Verifying Properties of Infinite Sequences of Description Logic Actions

Authors:
Franz Baader;Hongkai Liu;Anees ul Mehdi
Affiliations:
TU Dresden, Germany, email: {baader,liu}@tcs.inf.tu-dresden.de;TU Dresden, Germany, email: {baader,liu}@tcs.inf.tu-dresden.de;KIT Karlsruhe, Germany, email: ame@aifb.uni-karlsruhe.de
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 7
Cited 0

FLUX: A logic programming method for reasoning agents

Theory and Practice of Logic Programming
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Temporal Description Logics: A Survey

TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
Integrating description logics and action formalisms: first results

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Runtime verification using a temporal description logic

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Reducing inductive definitions to propositional satisfiability

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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üchi 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.