On metric temporal description logics

Gutierrez Basulto, Victor ORCID: https://orcid.org/0000-0002-6117-5459, Jung, Jean Christoph and Ozaki, Ana 2016. On metric temporal description logics. Presented at: 22nd European Conference on Artificial Intelligence, ECAI 2016, The Hague, The Netherlands, 29 August-2 September 2016. Published in: Kaminka, Gal A., Fox, Maria, Bouquet, Paolo, Hüllermeier, Eyke, Dignum, Virginia, Dignum, Frank and van Harmelen, Frank eds. Frontiers in Artifical Intelligence and Applications. , vol.285 Amsterdam: IOS Press, pp. 837-845. 10.3233/978-1-61499-672-9-837

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial. Download (366kB) | Preview

Abstract

We introduce metric temporal description logics (mTDLs) as combinations of the classical description logic ALC with (a) LTLbin, an extension of the temporal logic LTL with succinctly represented intervals, and (b) metric temporal logic MTL, extending LTLbin with capabilities to quantitatively reason about time delays. Our main contributions are algorithms and tight complexity bounds for the satisfiability problem in these mTDLs: For mTDLs based on (fragments of) LTLbin, we establish complexity bounds ranging from EXPTIME to 2EXPSPACE. For mTDLs based on (fragments of) MTL interpreted over the naturals, we establish complexity bounds ranging from EXPSPACE to 2EXPSPACE.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	IOS Press
ISBN:	978-1-61499-672-9
Date of First Compliant Deposit:	4 June 2018
Last Modified:	23 Oct 2022 13:51
URI:	https://orca.cardiff.ac.uk/id/eprint/111928

Citation Data

Cited 34 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item