Stage-oe-small.jpg

Inproceedings3160

Aus Aifbportal
Version vom 20. April 2011, 10:16 Uhr von Ame (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorNachname=Franz |ErsterAutorVorname=Baader }} {{Publikation Author |Rank=2 |Author=Hongkai Liu }} {{Publikation Author |Rank…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche


Verifying Properties of Infinite Sequences of Description Logic Actions


Verifying Properties of Infinite Sequences of Description Logic Actions



Published: 2010 August

Buchtitel: Proceedings of the 19th European Conference on Artificial Intelligence
Verlag: ECAI 2010

Nicht-referierte Veröffentlichung

BibTeX

Kurzfassung
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

Projekt

SOA4ALL



Forschungsgruppe

Wissensmanagement


Forschungsgebiet