×

A cookbook for temporal conceptual data modelling with description logics. (English) Zbl 1354.68245


MSC:

68T27 Logic in artificial intelligence
03B44 Temporal logic

Software:

TeMP; TSPASS; NuSMV

References:

[1] Tom Apostol. 1976. Introduction to Analytic Number Theory. Springer. · Zbl 0335.10001
[2] Alessandro Artale, Diego Calvanese, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. 2007a. Reasoning over extended ER models. In Proceedings of the 26th International Conference on Conceptual Modeling (ER’07). Lecture Notes in Computer Science, Vol. 4801. Springer-Verlag, Berlin, Heidelberg, 277–292.
[3] Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. 2007b. DL-Lite in the light of first-order logic. In Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI’07). 361–366.
[4] Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. 2009a. The DL-Lite family and relations. Journal of Artificial Intelligence Research 36, 1–69. · Zbl 1192.68657
[5] Alessandro Artale and Enrico Franconi. 1998. A temporal description logic for reasoning about actions and plans. Journal of Artificial Intelligence Research 9, 463–506. · Zbl 0911.68190
[6] Alessandro Artale and Enrico Franconi. 1999. Temporal ER modeling with description logics. In Proceedings of the 18th International Conference on Conceptual Modeling (ER’99). Lecture Notes in Computer Science, Vol. 1728. Springer-Verlag, Berlin, Heidelberg, 81–95. · Zbl 0998.03013
[7] Alessandro Artale and Enrico Franconi. 2001. A survey of temporal extensions of description logics. Annals of Mathematics and Artificial Intelligence 30, 1–4, 171–210. · Zbl 0998.03013
[8] Alessandro Artale and Enrico Franconi. 2005. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence. Elsevier, 375–388. · Zbl 0998.03013
[9] Alessandro Artale and Enrico Franconi. 2009. Foundations of temporal conceptual data models. In Conceptual Modeling: Foundations and Applications. Lecture Notes in Computer Science, Vol. 5600. Springer-Verlag, Berlin, Heidelberg, 10–35. · Zbl 1248.68160
[10] Alessandro Artale, Enrico Franconi, and Federica Mandreoli. 2003. Description logics for modelling dynamic information. In Logics for Emerging Applications of Databases. Springer, 239–275.
[11] Alessandro Artale, Enrico Franconi, Frank Wolter, and Michael Zakharyaschev. 2002. A temporal description logic for reasoning about conceptual schemas and queries. In Proceedings of the 8th Joint European Conference on Logics in Artificial Intelligence (JELIA’02). Lecture Notes in Artificial Intelligence, Vol. 2424. Springer-Verlag, Berlin, Heidelberg, 98–110. · Zbl 1013.03027
[12] Alessandro Artale, Roman Kontchakov, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. 2007c. Temporalising tractable description logics. In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME’07). IEEE Computer Society, Washington, DC, 11–22. · doi:10.1109/TIME.2007.62
[13] Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. 2009b. DL-Lite with temporalised concepts, rigid axioms and roles. In Proceedings of the 7th International Symposium on Frontiers of Combining Systems (FroCoS’09). Lecture Notes in Computer Science, Vol. 5749. Springer-Verlag, Berlin, Heidelberg, 133–148. · Zbl 1193.68232
[14] Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. 2010. Complexity of reasoning over temporal data models. In Proceedings of the 29th International Conference on Conceptual Modeling (ER’10). Lecture Notes in Computer Science, Vol. 4801. Springer-Verlag, Berlin, Heidelberg, 277–292. · Zbl 1348.68235
[15] Alessandro Artale, Roman Kontchakov, Frank Wolter, and Michael Zakharyaschev. 2013. Temporal description logic for ontology-based data access. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI’13). 711–717.
[16] Alessandro Artale, Carsten Lutz, and David Toman. 2007d. A description logic of change. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI’07). 218–223.
[17] Alessandro Artale, Christine Parent, and Stefano Spaccapietra. 2007e. Evolving objects in temporal information systems. Annals of Mathematics and Artificial Intelligence 50, 1–2, 5–38. · Zbl 1129.68094 · doi:10.1007/s10472-007-9068-z
[18] Franz Baader, Stefan Borgwardt, and Marcel Lippmann. 2013. Temporalizing ontology-based data access. In Proceedings of the 24th International Conference on Automated Deduction (CADE’13). Lecture Notes in Computer Science, Vol. 7898. Springer-Verlag, Berlin, Heidelberg, 330–344. · Zbl 1381.68075
[19] Franz Baader, Diego Calvanese, Deborah McGuinness, Daniele Nardi, and Peter F. Patel-Schneider (Eds.). 2003. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press. · Zbl 1058.68107
[20] Franz Baader, Silvio Ghilardi, and Carsten Lutz. 2008. LTL over description logic axioms. In Proceedings of the 11th International Conference on the Principles of Knowledge Representation and Reasoning (KR’08). 684–694. · Zbl 1351.68260
[21] Franz Baader, Silvio Ghilardi, and Carsten Lutz. 2012. LTL over description logic axioms. ACM Transactions on Computational Logic 13, 3, 21. · Zbl 1351.68260
[22] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, and Heribert Vollmer. 2009. The complexity of generalized satisfiability for linear temporal logic. Logical Methods in Computer Science 5, 1, 48–62. · Zbl 1183.03017 · doi:10.2168/LMCS-5(1:1)2009
[23] Daniela Berardi, Diego Calvanese, and Guiseppe De Giacomo. 2005. Reasoning on UML class diagrams. Artificial Intelligence 168, 1–2, 70–118. · Zbl 1132.68747 · doi:10.1016/j.artint.2005.05.003
[24] Claudio Bettini. 1997. Time dependent concepts: Representation and reasoning using temporal description logics. Data and Knowledge Engineering 22, 1, 1–38. · Zbl 0907.68183 · doi:10.1016/S0169-023X(96)00036-5
[25] Egon Börger, Erich Grädel, and Yuri Gurevich. 1997. The Classical Decision Problem. Springer.
[26] Alexander Borgida and Ronald J. Brachman. 2003. Conceptual modeling with description logics. In The Description Logic Handbook, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider (Eds.). Cambridge University Press, 349–372.
[27] Stefan Borgwardt, Marcel Lippmann, and Veronika Thost. 2013. Temporal query answering in the description logic DL-Lite. In Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS’13). Lecture Notes in Computer Science, Vol. 8152. Springer-Verlag, Berlin, Heidelberg, 165–180. · Zbl 1398.68121
[28] Diego Calvanese, Guiseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2005. DL-Lite: Tractable description logics for ontologies. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI’05). 602–607. · Zbl 1132.68725
[29] Diego Calvanese, Guiseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning 39, 3, 385–429. · Zbl 1132.68725 · doi:10.1007/s10817-007-9078-x
[30] Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Daniele Nardi. 2001. Reasoning in expressive description logics. In Handbook of Automated Reasoning. Vol. II. Elsevier Science Publishers, 1581–1634. · Zbl 0992.03036 · doi:10.1016/B978-044450813-3/50025-4
[31] Diego Calvanese, Maurizio Lenzerini, and Daniele Nardi. 1999. Unifying class-based representation formalisms. Journal of Artificial Intelligence Research 11, 199–240. · Zbl 0924.68184
[32] Cheng-Chia Chen and I.-Peng Lin. 1993. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information Processing Letters 45, 3, 131–136. · Zbl 0796.68116
[33] Peter Pin-Shan Chen. 1976. The entity-relationship model—toward a unified view of data. ACM Transactions on Database Systems 1, 9–36. · doi:10.1145/320434.320440
[34] Jan Chomicki, David Toman, and Michael H. Böhlen. 2001. Querying ATSQL databases with temporal logic. ACM Transactions on Database Systems 26, 2, 145–178. · Zbl 1136.68377
[35] Marek Chrobak. 1986. Finite automata and unary languages. Theoretical Computer Science 47, 2, 149–158. · Zbl 0638.68096 · doi:10.1016/0304-3975(86)90142-8
[36] Alessandro Cimatti, Edmund M. Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. 2002. NuSMV 2: An opensource tool for symbolic model checking. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV’02). Lecture Notes in Computer Science, Vol. 2404. Springer-Verlag, Berlin, Heidelberg, 359–364. · Zbl 1010.68766
[37] Carlo Combi, Sara Degani, and Christian S. Jensen. 2008. Capturing temporal constraints in temporal ER models. In Proceedings of the 27th International Conference on Conceptual Modeling (ER’08). Lecture Notes in Computer Science, Vol. 5231. Springer-Verlag, Berlin, Heidelberg, 397–411.
[38] Anatoli Degtyarev, Michael Fisher, and Boris Konev. 2006. Monodic temporal resolution. ACM Transactions on Computational Logic 7, 1, 108–150. · Zbl 1367.03035 · doi:10.1145/1119439.1119443
[39] Stephane Demri and Phillipe Schnoebelen. 2002. The complexity of propositional linear temporal logics in simple cases. Information and Computation 174, 1, 84–103. · Zbl 1009.68072 · doi:10.1006/inco.2001.3094
[40] Clare Dixon, Michael Fisher, and Boris Konev. 2007. Tractable temporal reasoning. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI’07). 318–323. · Zbl 1148.03311
[41] Julian Dolby, Achille Fokoue, Aditya Kalyanpur, Li Ma, Edith Schonberg, Kavitha Srinivas, and Xingzhi Sun. 2008. Scalable grounded conjunctive query evaluation over large and expressive knowledge bases. In Proceedings of the 7th International Semantic Web Conference (ISWC’08). Lecture Notes in Computer Science, Vol. 5318. Springer-Verlag, Berlin, Heidelberg, 403–418.
[42] Ramez A. Elmasri and Shamkant B. Navathe. 2007. Fundamentals of Database Systems (5th ed.). Addison Wesley. · Zbl 0722.68035
[43] Marcelo Finger and Peter McBrien. 2000. Temporal conceptual-level databases. In Temporal Logic: Mathematical Foundations and Computational Aspects, D. M. Gabbay, M. A. Reynolds, and M. Finger (Eds.). Oxford University Press, 409–435.
[44] Michael Fisher. 1991. A resolution method for temporal logic. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91). Morgan Kaufmann, 99–104. · Zbl 0745.68091
[45] Michael Fisher, Clare Dixon, and Martin Peim. 2001. Clausal temporal resolution. ACM Transactions on Computational Logic 2, 1, 12–56. · Zbl 1365.03017 · doi:10.1145/371282.371311
[46] Dov Gabbay, Marcelo Finger, and Mark Reynolds. 2000. Temporal Logic: Mathematical Foundations and Computational Aspects. Vol. 2. Oxford University Press. · Zbl 1014.03006
[47] Dov Gabbay, Ian Hodkinson, and Mark Reynolds. 1994. Temporal Logic: Mathematical Foundations and Computational Aspects. Vol. 1. Oxford University Press. · Zbl 0875.03007 · doi:10.1007/BFb0013976
[48] Dov Gabbay, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. 2003. Many-Dimensional Modal Logics: Theory and Applications. Studies in Logic and the Foundations of Mathematics, Vol. 148. Elsevier. · Zbl 1051.03001
[49] David Gabelaia, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. 2005. Products of “transitive” modal logics. Journal of Symbolic Logic 70, 3, 993–1021. · Zbl 1103.03020 · doi:10.2178/jsl/1122038925
[50] Stefan Göller, Jean Christoph Jung, and Markus Lohrey. 2012. The complexity of decomposing modal and first-order theories. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS’12). IEEE Computer Society, Washington, DC, 325–334. · Zbl 1364.03031
[51] Heidi Gregersen and Christian S. Jensen. 1998. Conceptual Modeling of Time-Varying Information. Technical Report TimeCenter TR-35. Aalborg University, Denmark.
[52] Heidi Gregersen and Christian S. Jensen. 1999. Temporal entity-relationship models: A survey. IEEE Transactions on Knowledge and Data Engineering 11, 3, 464–497. · doi:10.1109/69.774104
[53] Christian Guensel. 2005. A Tableaux-Based Reasoner for Temporalised Description Logics. Ph.D. Dissertation. University of Liverpool.
[54] Claudio Gutiérrez, Carlos A. Hurtado, and Alejandro A. Vaisman. 2005. Temporal RDF. In Proceedings of the 2nd European Semantic Web Conference (ESWC’05). Lecture Notes in Computer Science, Vol. 3532. Springer-Verlag, Berlin, Heidelberg, 93–107.
[55] Víctor Gutiérrez-Basulto and Szymon Klarman. 2012. Towards a unifying approach to representing and querying temporal data in description logics. In Proceedings of the 6th International Conference on Web Reasoning and Rule Systems (RR’12). Lecture Notes in Computer Science, Vol. 7497. Springer-Verlag, Berlin, Heidelberg, 90–105.
[56] Gary Hall and Ranabir Gupta. 1991. Modeling transition. In Proceedings of the 7th International Conference on Data Engineering (ICDE’91). IEEE Computer Society, Washington, DC, 540–549.
[57] Joseph Y. Halpern and John H. Reif. 1981. The propositional dynamic logic of deterministic, well-structured programs (extended abstract). In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (FOCS’81). IEEE Computer Society, Washington, DC, 322–334.
[58] Joseph Y. Halpern and Yoav Shoham. 1991. A propositional modal logic of time intervals. Journal of the ACM 38, 4, 935–962. · Zbl 0799.68175 · doi:10.1145/115234.115351
[59] Stijn Heymans, Li Ma, Darko Anicic, Zhilei Ma, Nathalie Steinmetz, Yue Pan, Jing Mei, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Edith Schonberg, Kavitha Srinivas, Cristina Feier, Graham Hench, Branimir Wetzstein, and Uwe Keller. 2008. Ontology reasoning with large data repositories. In Ontology Management, Semantic Web, Semantic Web Services, and Business Applications. Vol. 7. Springer, 89–128.
[60] Ian Hodkinson, Frank Wolter, and Michael Zakharyaschev. 2000. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic 106, 85–134. · Zbl 0999.03015 · doi:10.1016/S0168-0072(00)00018-X
[61] Ullrich Hustadt, Boris Konev, Alexandre Riazanov, and Andrei Voronkov. 2004. TeMP: A temporal monodic prover. In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR’04). Lecture Notes in Computer Science, Vol. 3097. Springer-Verlag, Berlin, Heidelberg, 326–330. · Zbl 1126.68568
[62] Christian S. Jensen and Richard T. Snodgrass. 1999. Temporal data management. IEEE Transactions on Knowledge and Data Engineering 111, 1, 36–44. · doi:10.1109/69.755613
[63] Roman Kontchakov, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. 2004. Temporalising tableaux. Studia Logica 76, 1, 91–134. · Zbl 1050.03015 · doi:10.1023/B:STUD.0000027468.28935.6d
[64] Roman Kontchakov, Mariano Rodríguez-Muro, and Michael Zakharyaschev. 2013. Ontology-based data access with databases: A short course. In Reasoning Web. The 9th International Summer School on Semantic Technologies for Intelligent Data Access. Lecture Notes in Computer Science, Vol. 8067. Springer-Verlag, Berlin, Heidelberg, 194–229.
[65] Agi Kurucz. 2007. Combining modal logics. In Handbook of Modal Logic, P. Blackburn, J. van Benthem, and F. Wolter (Eds.). Studies in Logic and Practical Reasoning, Vol. 3. Elsevier, 869–924.
[66] Orna Lichtenstein, Amir Pnueli, and Lenore D. Zuck. 1985. The glory of the past. In Proceedings of the Conference on Logic of Programs. Lecture Notes in Computer Science, Vol. 193. Springer-Verlag, Berlin, Heidelberg, 196–218. · Zbl 0586.68028
[67] Michel Ludwig and Ullrich Hustadt. 2010. Implementing a fair monodic temporal logic prover. AI Communications 23, 2–3, 69–96. · Zbl 1206.68283
[68] Carsten Lutz, Holger Sturm, Frank Wolter, and Michael Zakharyaschev. 2002. A tableau decision algorithm for modalized ALC with constant domains. Studia Logica 72, 2, 199–232. · Zbl 1010.03012 · doi:10.1023/A:1021308527417
[69] Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. 2008. Temporal description logics: A survey. In Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME’08). IEEE Computer Society, Washington, DC, 3–14.
[70] Nicolas Markey. 2004. Past is for free: On the complexity of verifying linear temporal properties with past. Acta Informatica 40, 6–7, 431–458. · Zbl 1084.68073 · doi:10.1007/s00236-003-0136-5
[71] Peter McBrien, Anna H. Seltveit, and Benkt Wangler. 1992. An entity-relationship model extended to describe historical information. In Proceedings of the International Conference on Information Systems and Management of Data (CISMOD’92). 244–260.
[72] Alberto O. Mendelzon, Tova Milo, and Emmanuel Waller. 1994. Object migration. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’94). ACM Press, New York, NY, 232–242. DOI:http://dx.doi.org/10.1145/182591.182616 · doi:10.1145/182591.182616
[73] Boris Motik. 2012. Representing and querying validity time in RDF and OWL: A logic-based approach. Journal of Web Semantics 12, 3–21. · doi:10.1016/j.websem.2011.11.004
[74] Hiroakira Ono and Akira Nakamura. 1980. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica 39, 325–333. · Zbl 0466.03008 · doi:10.1007/BF00713542
[75] Christos M. Papadimitriou. 1994. Computational Complexity. Addison-Wesley, Reading, MA. · Zbl 0833.68049
[76] Christine Parent, Stefano Spaccapietra, and Esteban Zimanyi. 2006. Conceptual Modeling for Traditional and Spatio-Temporal Applications: The MADS Approach. Springer. · Zbl 1092.68030
[77] David Plaisted. 1986. A decision procedure for combinations of propositional temporal logic and other specialized theories. Journal of Automated Reasoning 2, 171–190. · Zbl 0635.03026 · doi:10.1007/BF02432150
[78] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Riccardo Rosati. 2008. Linking data to ontologies. Journal on Data Semantics X, 133–173. · Zbl 1132.68061
[79] Axel Polleres, Aidan Hogan, Renaud Delbru, and Jurgen Umbrich. 2013. RDFS and OWL reasoning for linked data. In Reasoning Web. The 9th International Summer School on Semantic Technologies for Intelligent Data Access. Lecture Notes in Computer Science, Vol. 8067. Springer-Verlag, Berlin, Heidelberg, 91–149. · doi:10.1007/978-3-642-39784-4_2
[80] Alexander Rabinovich. 2010. Temporal logics over linear time domains are in PSPACE. In Proceedings of the 4th International Workshop on Reachability Problems. Lecture Notes in Computer Science, Vol. 6227. Springer-Verlag, Berlin, Heidelberg, 29–50. · Zbl 1287.68081
[81] Mark Reynolds. 2010. The complexity of decision problems for linear temporal logics. Journal of Studies in Logic 3, 1, 19–50.
[82] Klaus Schild. 1993. Combining terminological logics with tense logic. In Proceedings of the 6th Portuguese Conference on Artificial Intelligence (EPIA’93). Springer-Verlag, Berlin, Heidelberg, 105–120.
[83] Albrecht Schmiedel. 1990. A temporal terminological logic. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI’90). 640–645.
[84] A. Prasad Sistla and Edmund M. Clarke. 1982. The complexity of propositional linear temporal logics. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC’82). ACM Press, New York, NY, 159–168.
[85] Larry J. Stockmeyer and Albert R. Meyer. 1973. Word problems requiring exponential time: Preliminary report. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC’73). ACM Press, New York, NY, 1–9. · Zbl 0359.68050 · doi:10.1145/800125.804029
[86] Jianwen Su. 1997. Dynamic constraints and object migration. Theoretical Computer Science 184, 1–2, 195–236. · Zbl 0901.68044 · doi:10.1016/S0304-3975(96)00142-9
[87] Branka Tauzovich. 1991. Towards temporal extensions to the entity-relationship model. In Proceedings of the 10th International Conference on Conceptual Modeling (ER’91). 163–179.
[88] Charalampos I. Theodoulidis, Pericles Loucopoulos, and Benkt Wangler. 1991. A conceptual modelling formalism for temporal database applications. Information Systems 16, 3, 401–416. · doi:10.1016/0306-4379(91)90031-4
[89] Anthony Widjaja To. 2009. Unary finite automata vs. arithmetic progressions. Information Processing Letters 109, 17, 1010–1014. DOI:http://dx.doi.org/10.1016/j.ipl.2009.06.005 · Zbl 1202.68241 · doi:10.1016/j.ipl.2009.06.005
[90] Frank Wolter and Michael Zakharyaschev. 1999. Modal description logics: Modalizing roles. Fundamenta Informaticæ 39, 411–438. · Zbl 0951.03011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.