research-article

A Cookbook for Temporal Conceptual Data Modelling with Description Logics

Authors:

Alessandro Artale,

Roman Kontchakov,

Vladislav Ryzhikov,

Michael ZakharyaschevAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 15, Issue 3

Article No.: 25, Pages 1 - 50

https://doi.org/10.1145/2629565

Published: 25 July 2014 Publication History

Abstract

We design temporal description logics (TDLs) suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (ℤ, <), satisfying the constant domain assumption. Concept and role inclusions of the TBox hold at all moments of time (globally), and data assertions of the ABox hold at specified moments of time. To express temporal constraints of conceptual data models, the languages are equipped with flexible and rigid roles, standard future and past temporal operators on concepts, and operators “always” and “sometime” on roles. The most expressive of our TDLs (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turns out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions, we construct logics whose complexity ranges between NLogSpace and PSpace. These positive results are obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models.

Supplementary Material

a25-artale-apndx.pdf (artale.zip)

Supplemental movie, appendix, image and software files for, A Cookbook for Temporal Conceptual Data Modelling with Description Logics

Download
83.97 KB

References

[1]

Tom Apostol. 1976. Introduction to Analytic Number Theory. Springer.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[8]

Alessandro Artale and Enrico Franconi. 2005. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence. Elsevier, 375--388.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

[21]

Franz Baader, Silvio Ghilardi, and Carsten Lutz. 2012. LTL over description logic axioms. ACM Transactions on Computational Logic 13, 3, 21.

Digital Library

[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.

[23]

Daniela Berardi, Diego Calvanese, and Guiseppe De Giacomo. 2005. Reasoning on UML class diagrams. Artificial Intelligence 168, 1--2, 70--118.

Digital Library

[24]

Claudio Bettini. 1997. Time dependent concepts: Representation and reasoning using temporal description logics. Data and Knowledge Engineering 22, 1, 1--38.

Digital Library

[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.

Digital Library

[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.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[31]

Diego Calvanese, Maurizio Lenzerini, and Daniele Nardi. 1999. Unifying class-based representation formalisms. Journal of Artificial Intelligence Research 11, 199--240.

Digital Library

[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.

Digital Library

[33]

Peter Pin-Shan Chen. 1976. The entity-relationship model—toward a unified view of data. ACM Transactions on Database Systems 1, 9--36.

Digital Library

[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.

Digital Library

[35]

Marek Chrobak. 1986. Finite automata and unary languages. Theoretical Computer Science 47, 2, 149--158.

Digital Library

[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.

Digital Library

[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.

Digital Library

[38]

Anatoli Degtyarev, Michael Fisher, and Boris Konev. 2006. Monodic temporal resolution. ACM Transactions on Computational Logic 7, 1, 108--150.

Digital Library

[39]

Stephane Demri and Phillipe Schnoebelen. 2002. The complexity of propositional linear temporal logics in simple cases. Information and Computation 174, 1, 84--103.

Digital Library

[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.

Digital Library

[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.

Digital Library

[42]

Ramez A. Elmasri and Shamkant B. Navathe. 2007. Fundamentals of Database Systems (5th ed.). Addison Wesley.

Digital Library

[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.

Digital Library

[45]

Michael Fisher, Clare Dixon, and Martin Peim. 2001. Clausal temporal resolution. ACM Transactions on Computational Logic 2, 1, 12--56.

Digital Library

[46]

Dov Gabbay, Marcelo Finger, and Mark Reynolds. 2000. Temporal Logic: Mathematical Foundations and Computational Aspects. Vol. 2. Oxford University Press.

[47]

Dov Gabbay, Ian Hodkinson, and Mark Reynolds. 1994. Temporal Logic: Mathematical Foundations and Computational Aspects. Vol. 1. Oxford University Press.

Digital Library

[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.

[49]

David Gabelaia, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. 2005. Products of “transitive” modal logics. Journal of Symbolic Logic 70, 3, 993--1021.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[58]

Joseph Y. Halpern and Yoav Shoham. 1991. A propositional modal logic of time intervals. Journal of the ACM 38, 4, 935--962.

Digital Library

[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.

[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.

[62]

Christian S. Jensen and Richard T. Snodgrass. 1999. Temporal data management. IEEE Transactions on Knowledge and Data Engineering 111, 1, 36--44.

Digital Library

[63]

Roman Kontchakov, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. 2004. Temporalising tableaux. Studia Logica 76, 1, 91--134.

[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.

Digital Library

[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.

Digital Library

[67]

Michel Ludwig and Ullrich Hustadt. 2010. Implementing a fair monodic temporal logic prover. AI Communications 23, 2--3, 69--96.

Digital Library

[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.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[73]

Boris Motik. 2012. Representing and querying validity time in RDF and OWL: A logic-based approach. Journal of Web Semantics 12, 3--21.

Digital Library

[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.

[75]

Christos M. Papadimitriou. 1994. Computational Complexity. Addison-Wesley, Reading, MA.

[76]

Christine Parent, Stefano Spaccapietra, and Esteban Zimanyi. 2006. Conceptual Modeling for Traditional and Spatio-Temporal Applications: The MADS Approach. Springer.

Digital Library

[77]

David Plaisted. 1986. A decision procedure for combinations of propositional temporal logic and other specialized theories. Journal of Automated Reasoning 2, 171--190.

Digital Library

[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.

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[83]

Albrecht Schmiedel. 1990. A temporal terminological logic. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI'90). 640--645.

Digital Library

[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.

Digital Library

[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.

Digital Library

[86]

Jianwen Su. 1997. Dynamic constraints and object migration. Theoretical Computer Science 184, 1--2, 195--236.

Digital Library

[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.

Digital Library

[89]

Anthony Widjaja To. 2009. Unary finite automata vs. arithmetic progressions. Information Processing Letters 109, 17, 1010--1014.

Digital Library

[90]

Frank Wolter and Michael Zakharyaschev. 1999. Modal description logics: Modalizing roles. Fundamenta Informaticæ 39, 411--438.

Digital Library

Cited By

Artale AKontchakov RMazzullo AWolter FMarquis POrtiz MPagnucco M(2024)Non-rigid designators in modal and temporal free description logicsProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/8(82-93)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/8
Jung JRyzhikov VWolter FZakharyaschev MMarquis POrtiz MPagnucco M(2024)Unique characterisability and learnability of temporal queries mediated by an ontologyProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/46(487-497)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/46
Tamani N(2024)Towards a Time-Dependent Approach for User Privacy Expression and EnforcementInformation Security Theory and Practice10.1007/978-3-031-60391-4_10(146-161)Online publication date: 29-Feb-2024
https://dl.acm.org/doi/10.1007/978-3-031-60391-4_10
Show More Cited By

Index Terms

A Cookbook for Temporal Conceptual Data Modelling with Description Logics

Recommendations

Undecidability of the unification and admissibility problems for modal and description logics

We show that the unification problem “is there a substitution instance of a given formula that is provable in a given logic?” is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the admissibility problem ...
Embedding-based approaches to paraconsistent and temporal description logics*

In this article, some paraconsistent and temporal description logics are studied based on an embedding-based proof method. A new paraconsistent description logic, PALC , is obtained from the description logic ALC by adding a paraconsistent negation. Two ...
Using tableau to decide description logics with full role negation and identity

This article presents a tableau approach for deciding expressive description logics with full role negation and role identity. We consider the description logic ALBO^id, which is ALC extended with the Boolean role operators, inverse of roles, the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 15, Issue 3

July 2014

250 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/2648783

Editor:
Dale Miller
INRIA Saclay, France

Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2014

Accepted: 01 February 2014

Revised: 01 October 2013

Received: 01 September 2012

Published in TOCL Volume 15, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Engineering and Physical Sciences Research Council

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
363
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)2

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Artale AKontchakov RMazzullo AWolter FMarquis POrtiz MPagnucco M(2024)Non-rigid designators in modal and temporal free description logicsProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/8(82-93)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/8
Jung JRyzhikov VWolter FZakharyaschev MMarquis POrtiz MPagnucco M(2024)Unique characterisability and learnability of temporal queries mediated by an ontologyProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/46(487-497)Online publication date: 2-Nov-2024
https://dl.acm.org/doi/10.24963/kr.2024/46
Tamani N(2024)Towards a Time-Dependent Approach for User Privacy Expression and EnforcementInformation Security Theory and Practice10.1007/978-3-031-60391-4_10(146-161)Online publication date: 29-Feb-2024
https://dl.acm.org/doi/10.1007/978-3-031-60391-4_10
Westhofen LNeurohr CJung JNeider D(2024)Answering Temporal Conjunctive Queries over Description Logic Ontologies for Situation Recognition in Complex Operational DomainsTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57246-3_10(167-187)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57246-3_10
Gigante NÁlvarez LLyon TMarquis PSon TKern-Isberner G(2023)Standpoint linear temporal logicProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/31(311-321)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/31
Badie F(2023)Towards World Identification in Description LogicsLogical Investigations10.21146/2074-1472-2022-28-2-115-13428:2(115-134)Online publication date: 11-Jan-2023
https://doi.org/10.21146/2074-1472-2022-28-2-115-134
Artale AGeatti LGigante NMazzullo AMontanari AWilliams BChen YNeville J(2023)Complexity of safety and cosafety fragments of linear temporal logicProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i5.25768(6236-6244)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i5.25768
BORGWARDT SFORKEL WKOVTUNOVA A(2021)Temporal Minimal-World Query Answering over Sparse ABoxesTheory and Practice of Logic Programming10.1017/S147106842100011922:2(193-228)Online publication date: 11-Aug-2021
https://doi.org/10.1017/S1471068421000119
Eiden AEickhoff TGries JGöbel JPsota T(2021)Supporting semantic PLM by using a lightweight engineering metadata mapping engineProcedia CIRP10.1016/j.procir.2021.05.146100(690-695)Online publication date: 2021
https://doi.org/10.1016/j.procir.2021.05.146
Artale AKontchakov RKovtunova ARyzhikov VWolter FZakharyaschev M(2021)First-order rewritability of ontology-mediated queries in linear temporal logicArtificial Intelligence10.1016/j.artint.2021.103536299(103536)Online publication date: Oct-2021
https://doi.org/10.1016/j.artint.2021.103536
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents