Open AccessOn the Complexity of Verifying Timed Golog Programs over Description Logic Actions (Extended Version)
Author(s) -
Benjamin Zarrieß,
Patrick Koopmann
Publication year - 2018
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.241
Subject(s) - undecidable problem , computer science , decidability , temporal logic , timeline , programming language , theoretical computer science , property (philosophy) , linear temporal logic , parameterized complexity , model checking , algorithm , mathematics , philosophy , statistics , epistemology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom