Content: Publications

Situation Calculus Meets Description Logics

In Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, pp. 240--265

Authors:Jens Claßen, Gerhard Lakemeyer, Benjamin Zarrieß
Type:Article in a Collection
Publication Date:June 2019
Collection:Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, volume 11560
Publisher:Springer
Editor:Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter
Series:Lecture Notes in Computer Science
Volume:11560

Abstract: For more than six years, the groups of Franz Baader and Gerhard Lakemeyer have collaborated in the area of decidable verification of Golog programs. Golog is an action programming language, whose semantics is based on the Situation Calculus, a variant of full first-order logic. In order to achieve decidability, the expressiveness of the base logic had to be restricted, and using a Description Logic was a natural choice. In this chapter, we highlight some of the main results and insights obtained during our collaboration.

BibTeX
@InCollection{hybris-a1-sitcalc_dl-2019,
  title =	{{Situation Calculus Meets Description Logics}},
  author =	{Jens Claßen and Gerhard Lakemeyer and Benjamin Zarrieß},
  booktitle =	{Proc. of Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday},
  year =	{2019},
  month =	{June},
  editor =	{Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter},
  publisher =	{Springer},
  series =	{Lecture Notes in Computer Science},
  volume =	{{{object.volume}},
  pages =	{240--265},
}