Horn Fragments of the Halpern-Shoham Interval Temporal Logic
- Submitting institution
-
King's College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 86472675
- Type
- D - Journal article
- DOI
-
10.1145/3105909
- Title of journal
- ACM Transactions on Computational Logic
- Article number
- 22
- First page
- 1
- Volume
- 18
- Issue
- 3
- ISSN
- 1529-3785
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Halpern-Shoham's interval temporal logic HS has been widely used for 25 years in research on specifying constraints/views over temporal data. This paper: solved (10) open problems on the computational complexity of Horn and other core fragments of HS arisen in that research; gave a complexity classification covering almost all semantical choices; established new connections between proof methodologies for interval temporal logics and twodimensional modal logics; and discovered new tractable Horn fragments, subsequently included in the framework for ontology-based data access to numeric temporal data (Brandt et al. TIME 2019, doi:10.4230/LIPIcs.TIME.2019.7) and now being implemented at the start-up Ontopic, Italy.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -