{"type":"ScholarlyArticle","title":"On the First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic (Extended Abstract)","authors":[{"name":"Alessandro Artale","slug":"alessandro-artale","given":"Alessandro","family":"Artale","affiliation":"KRDB Research Centre , Free University of Bozen-Bolzano , Italy"},{"name":"Roman Kontchakov","slug":"roman-kontchakov","given":"Roman","family":"Kontchakov","affiliation":"Department of Computer Science and Information Systems , Birkbeck , University of London , UK"},{"name":"Alisa Kovtunova","slug":"alisa-kovtunova","given":"Alisa","family":"Kovtunova","affiliation":"Chair for Automata Theory , Technische Universität Dresden , Germany"},{"name":"Vladislav Ryzhikov","slug":"vladislav-ryzhikov","given":"Vladislav","family":"Ryzhikov","affiliation":"Department of Computer Science and Information Systems , Birkbeck , University of London , UK"},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":"Department of Computer Science , University of Liverpool , UK"},{"name":"Michael Zakharyaschev","slug":"michael-zakharyaschev","given":"Michael","family":"Zakharyaschev","affiliation":"Department of Computer Science and Information Systems , Birkbeck , University of London , UK"}],"abstract":"We argue that linear temporal logic LTL in tandem with monadic first-order logic can be used as a ba- sic language for ontology-based access to tempo- ral data and obtain a classification of the resulting ontology-mediated queries according to the type of standard first-order queries they can be rewritten to.","doi":"10.24963/ijcai.2022/794","url":"https://ijcai.org/proceedings/2022/794","pdf":"https://ijcai.org/proceedings/2022/0794.pdf","markdown":"https://ijcai.org/proceedings/2022/794.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/794","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Journal Track","track":"Journal Track","number":794,"pages":{"first":5703,"last":5707},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving","Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Knowledge Representation Languages"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987241","length_sec":98,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985384","length_sec":466,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Artale et al., 2009] A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite family and relations. J. Artif. Intell. Res., 36:1-69, 2009.","title":"The DL-Lite family and relations","authors":"A Artale, D Calvanese, R Kontchakov, M Zakharyaschev","year":"2009","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Artale et al., 2017] A. Artale, R. Kontchakov, A. Kovtuno- va, V. Ryzhikov, F. Wolter, M. Zakharyaschev. Temporal ontology-mediated querying: A survey. In TIME, 2017.","title":"Temporal ontology-mediated querying: A survey","authors":"A Artale, R Kontchakov, A Kovtunova, V Ryzhikov, F Wolter, M Zakharyaschev","year":"2017","venue":"TIME","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Artale et al., 2021a] A. Artale, R. Kontchakov, A. Kovtuno- va, V. Ryzhikov, F. Wolter, M. Zakharyaschev. First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries. CoRR, abs/2111.06806, 2021.","title":"First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries","authors":"Artale","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Artale et al., 2021b] A. Artale, R. Kontchakov, A. Kov- tunova, V. Ryzhikov, F. Wolter, and M. Zakharyaschev. First-order rewritability of ontology-mediated queries in linear temporal logic. Artif. Intell., 299:103536, 2021.","title":"First-order rewritability of ontology-mediated queries in linear temporal logic","authors":"Artale","year":"2021","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bienvenu et al., 2014] M. Bienvenu, B. ten Cate, C. Lutz, and F. Wolter. Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP. ACM Trans. on Database Systems, 39(4):33:1-44, 2014.","title":"Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP","authors":"M Bienvenu, B Cate, C Lutz, F Wolter","year":"2014","venue":"ACM Trans. on Database Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Borgwardt et al., 2015] S. Borgwardt, M. Lippmann, and V. Thost. Temporalizing rewritable query languages over knowledge bases. J. Web Semant., 33:50-70, 2015.","title":"Temporalizing rewritable query languages over knowledge bases","authors":"S Borgwardt, M Lippmann, V Thost","year":"2015","venue":"J. Web Semant","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Borgwardt et al., 2019] S. Borgwardt, W. Forkel, A. Kov- tunova. Finding new diamonds: Temporal minimal-world query answering over sparse ABoxes. RuleML+RR, 2019.","title":"Finding new diamonds: Temporal minimal-world query answering over sparse ABoxes","authors":"S Borgwardt, W Forkel, A Kovtunova","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brandt et al., 2018] S. Brandt, E. Kalayci, V. Ryzhikov, G. Xiao, M. Zakharyaschev. Querying log data with metric temporal logic. J. Artif. Intell. Res., 62:829-877, 2018.","title":"Querying log data with metric temporal logic","authors":"S Brandt, E Kalayci, V Ryzhikov, G Xiao, M Zakharyaschev","year":"2018","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calvanese et al., 2007a] D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. EQL-Lite: Ef- fective first-order query processing in description logics. In Proc. IJCAI, pages 274-279, 2007.","title":"EQL-Lite: Effective first-order query processing in description logics","authors":"Calvanese","year":"2007","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/42"},{"position":10,"raw":"[Calvanese et al., 2007b] D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reason., 39(3):385-429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Cho and Huynh, 1991] S. Cho and D. T. Huynh. Finite- automaton aperiodicity is PSPACE-complete. Theor. Comp. Sci., 88(1):99-116, 1991.","title":"Finiteautomaton aperiodicity is PSPACE-complete","authors":"S Cho, D T Huynh","year":"1991","venue":"Theor. Comp. Sci","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Compton and Laflamme, 1990] K. J. Compton and C. Laflamme. An algebra and a logic for NC 1 . Inf. Comput., 87(1/2):240-262, 1990.","title":"An algebra and a logic for NC 1","authors":"K J Compton, C Laflamme","year":"1990","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Demri et al., 2016] S. Demri, V. Goranko, and M. Lange. Temporal Logics in Computer Science. CUP, 2016.","title":"Temporal Logics in Computer Science","authors":"S Demri, V Goranko, M Lange","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gabbay et al., 1994] D. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1. OUP, 1994.","title":"Temporal Logic: Mathematical Foundations and Computational Aspects","authors":"D Gabbay, I Hodkinson, M Reynolds","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Glimm and Ogbuji, 2013] B. Glimm and C Ogbuji. SPARQL 1.1 entailment regimes. W3C recommenda- tion. http://www.w3.org/TR/sparql11-entailment, 2013. Accessed: 2022-03-21.","title":"SPARQL 1.1 entailment regimes. W3C recommendation","authors":"B Glimm, Ogbuji","year":"2022","venue":null,"doi":null,"url":"http://www.w3.org/TR/sparql11-entailment,2013","internal_url":null},{"position":16,"raw":"[Gutiérrez-Basulto et al., 2016] V. Gutiérrez-Basulto, J. C. Jung, and R. Kontchakov. Temporalized EL ontologies for accessing temporal data: Complexity of atomic queries. Proc. IJCAI, 2016.","title":"Temporalized EL ontologies for accessing temporal data: Complexity of atomic queries","authors":"V Gutiérrez-Basulto, J C Jung, R Kontchakov","year":"2016","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/160"},{"position":17,"raw":"[Hernich et al., 2020] A. Hernich, C. Lutz, F. Papacchini, and F. Wolter. Dichotomies in ontology-mediated query- ing with the guarded fragment. ACM Trans. Comput. Log., 21(3):20:1-20:47, 2020.","title":"Dichotomies in ontology-mediated querying with the guarded fragment","authors":"A Hernich, C Lutz, F Papacchini, F Wolter","year":"2020","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kamp, 1968] H. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, UCLA, 1968.","title":"Tense Logic and the Theory of Linear Order","authors":"H W Kamp","year":"1968","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kanellakis et al., 1995] P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. J. Comput. Syst. Sci., 51(1):26-52, 1995.","title":"Constraint query languages","authors":"P Kanellakis, G Kuper, P Revesz","year":"1995","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kanellakis, 1990] P. C. Kanellakis. Elements of relational database theory. In Handbook of Theoretical Computer Science, pp.1073-1156. Elsevier & MIT Press, 1990.","title":"Elements of relational database theory","authors":"P C Kanellakis","year":"1990","venue":"Handbook of Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Koymans, 1990] R. Koymans. Specifying real-time prop- erties with metric temporal logic. Real-Time Systems, 2(4):255-299, 1990.","title":"Specifying real-time properties with metric temporal logic","authors":"R Koymans","year":"1990","venue":"Real-Time Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kurucz et al., 2021] A. Kurucz, V. Ryzhikov, Y. Savateev, and M. Zakharyaschev. Deciding FO-definability of reg- ular languages. In Proc. RAMiCS, vol. 13027 of LNCS, pages 241-257. Springer, 2021.","title":"Deciding FO-definability of regular languages","authors":"A Kurucz, V Ryzhikov, Y Savateev, M Zakharyaschev","year":"2021","venue":"Proc. RAMiCS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lutz et al., 2008] C. Lutz, F. Wolter, and M. Zakharyaschev. Temporal description logics: A survey. In Proc. TIME'08.","title":"Temporal description logics: A survey","authors":"C Lutz, F Wolter, M Zakharyaschev","year":null,"venue":"Proc. TIME'08","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ouaknine and Worrell, 2008] J. Ouaknine and J. Worrell. Some recent results in metric temporal logic. In Proc. FORMATS, pages 1-13, 2008.","title":"Some recent results in metric temporal logic","authors":"J Ouaknine, J Worrell","year":"2008","venue":"Proc. FORMATS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Poggi et al., 2008] A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. on Data Semantics, X:133-173, 2008.","title":"Linking data to ontologies","authors":"A Poggi, D Lembo, D Calvanese, G De Giacomo, M Lenzerini, R Rosati","year":"2008","venue":"J. on Data Semantics","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Prior, 1956] A. Prior. Time and Modality. OUP, 1956.","title":"Time and Modality","authors":"A Prior","year":"1956","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Revesz, 1993] P. Z. Revesz. A closed-form evaluation for datalog queries with integer (gap)-order constraints. Theor. Comput. Sci., 116(1):117-149, 1993.","title":"A closed-form evaluation for datalog queries with integer (gap)-order constraints","authors":"P Z Revesz","year":"1993","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Ryzhikov et al., 2019] V. Ryzhikov, P. A. Walega, and M. Zakharyaschev. Data complexity and rewritability of ontology-mediated queries in metric temporal logic under the event-based semantics. In Proc. IJCAI, 2019.","title":"Data complexity and rewritability of ontology-mediated queries in metric temporal logic under the event-based semantics","authors":"V Ryzhikov, P A Walega, M Zakharyaschev","year":"2019","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/256"},{"position":29,"raw":"[Ryzhikov et al., 2021] V. Ryzhikov, Y. Savateev, M. Zakha- ryaschev. Deciding FO-rewritability of ontology-mediated queries in linear temporal logic. In Proc. TIME, 2021.","title":"Deciding FO-rewritability of ontology-mediated queries in linear temporal logic","authors":"V Ryzhikov, Y Savateev, M Zakharyaschev","year":"2021","venue":"Proc. TIME","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Toman and Chomicki, 1998] D. Toman and J. Chomicki. Datalog with integer periodicity constraints. J. Log. Pro- gram., 35(3):263-290, 1998.","title":"Datalog with integer periodicity constraints","authors":"D Toman, J Chomicki","year":"1998","venue":"J. Log. Program","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wang et al., 2022] D. Wang, P. Hu, P. Walega, B. Cuenca Grau. Meteor: Practical reasoning in datalog with metric temporal operators. In Proc. AAAI, 2022.","title":"Meteor: Practical reasoning in datalog with metric temporal operators","authors":"D Wang, P Hu, P Walega, B Cuenca Grau","year":"2022","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Xiao et al., 2018] G. Xiao, D. Calvanese, R. Kontchakov, D. Lembo, A. Poggi, R. Rosati, M. Zakharyaschev. Onto- logy-based data access: A survey. In Proc. IJCAI, 2018.","title":"Ontology-based data access: A survey","authors":"G Xiao, D Calvanese, R Kontchakov, D Lembo, A Poggi, R Rosati, M Zakharyaschev","year":"2018","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/777"},{"position":33,"raw":"[Xiao et al., 2019] G. Xiao, L. Ding, B. Cogrel, and D. Cal- vanese. Virtual knowledge graphs: An overview of sys- tems and use cases. Data Intell., 1(3):201-223, 2019.","title":"Virtual knowledge graphs: An overview of systems and use cases","authors":"G Xiao, L Ding, B Cogrel, D Calvanese","year":"2019","venue":"Data Intell","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}