Hybrid logics and ontology languages. (English) Zbl 1278.68287
Blackburn, Patrick (ed.) et al., Proceedings of the international workshop on hybrid logic (HyLo 2006), Seattle, WA, USA, August 11, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 174, No. 6, 3-14 (2007).
Summary: Description logics (DLs) are a family of logic-based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for widely used ontology languages such as OIL, DAML+OIL and OWL, the last of which is now a World Wide Web Consortium (W3C) recommendation. \(\mathcal{SHOIN}\), the DL underlying OWL DL (the most widely used “species” of OWL), includes familiar features from hybrid logic. In particular, in order to support extensionally defined classes, \(\mathcal{SHOIN}\) includes nominals: classes whose extension is a singleton set. This is an important feature for a logic that is designed for use in ontology language applications, because extensionally defined classes are very common in ontologies. Binders and state variables are another feature from hybrid logic that would clearly be useful in an ontology language, but it is well known that adding this feature to even a relatively weak language would lead to undecidability. However, recent work has shown that this feature could play a very useful role in query answering, where the syntactic structure of queries means that the occurrence of state variables is restricted in a way that allows for decidable reasoning.
For the entire collection see [Zbl 1273.68016].
For the entire collection see [Zbl 1273.68016].
References:
| [1] | F. Baader and P. Hanschke. A schema for integrating concrete domains into concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91); F. Baader and P. Hanschke. A schema for integrating concrete domains into concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91) · Zbl 0742.68063 |
| [2] | Baader, F.; Sattler, U., An overview of tableau algorithms for description logics, Studia Logica, 69, 1, 5-40 (Oct. 2001) · Zbl 0991.03012 |
| [3] | Bechhofer, S.; van Harmelen, F.; Hendler, J.; Horrocks, I.; McGuinness, D. L.; Patel-Schneider, P. F.; Stein, L. A., OWL web ontology language reference. W3C Recommendation (10 February 2004), Available at |
| [4] | Blackburn, P.; Seligman, J., Hybrid languages, Journal of Logic, Language and Information, 4, 3, 251-272 (1995), Special issue on decompositions of first-order logic · Zbl 0847.03009 |
| [5] | D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS’98); D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS’98) |
| [6] | D. Calvanese, G. De Giacomo, M. Lenzerini, D. Nardi, and R. Rosati. Description logic framework for information integration. In Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR’98); D. Calvanese, G. De Giacomo, M. Lenzerini, D. Nardi, and R. Rosati. Description logic framework for information integration. In Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR’98) |
| [7] | B. Glimm, I. Horrocks, C. Lutz, and U. Sattler. Conjunctive query answering for \(\mathcal{SHIQ} \); B. Glimm, I. Horrocks, C. Lutz, and U. Sattler. Conjunctive query answering for \(\mathcal{SHIQ} \) · Zbl 1183.68244 |
| [8] | B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for description logics with transitive roles. In Proc. of the 2006 Description Logic Workshop (DL 2006)http://ceur-ws.org/; B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for description logics with transitive roles. In Proc. of the 2006 Description Logic Workshop (DL 2006)http://ceur-ws.org/ |
| [9] | B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for the description logic \(\mathcal{SHOIQ} \); B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for the description logic \(\mathcal{SHOIQ} \) · Zbl 1183.68244 |
| [10] | Grädel, E., The decidability of guarded fixed point logic, (Gerbrandy, J.; Marx, M.; de Rijke, M.; Venema, Y., Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday (1999), Amsterdam University Press) |
| [11] | V. Haarslev and R. Möller. Description of the RACER system and its applications. In Proc. of the 2001 Description Logic Workshop (DL 2001)http://ceur-ws.org/Vol-49/; V. Haarslev and R. Möller. Description of the RACER system and its applications. In Proc. of the 2001 Description Logic Workshop (DL 2001)http://ceur-ws.org/Vol-49/ |
| [12] | V. Haarslev, R. Möller, and M. Wessel. Querying the Semantic Web with Racer + nRQL. In Proc. of the KI-2004 Intl. Workshop on Applications of Description Logics (ADL’04); V. Haarslev, R. Möller, and M. Wessel. Querying the Semantic Web with Racer + nRQL. In Proc. of the KI-2004 Intl. Workshop on Applications of Description Logics (ADL’04) |
| [13] | J. Hladik and J. Model. Tableau systems for SHIO and SHIQ. In Proc. of the 2004 Description Logic Workshop (DL 2004)ceur-ws.org; J. Hladik and J. Model. Tableau systems for SHIO and SHIQ. In Proc. of the 2004 Description Logic Workshop (DL 2004)ceur-ws.org |
| [14] | Horrocks, I.; Patel-Schneider, P. F.; van Harmelen, F., From \(SHIQ\) and RDF to OWL: The making of a web ontology language, J. of Web Semantics, 1, 1, 7-26 (2003) |
| [15] | Horrocks, I.; Sattler, U., Ontology reasoning in the \(SHOQ(D)\) description logic, (Proc. of the 17th Int. Joint Conf. on Artificial Intelligence. Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, (IJCAI 2001) (2001), Morgan Kaufmann: Morgan Kaufmann Los Altos), 199-204 |
| [16] | I. Horrocks and U. Sattler. A tableaux decision procedure for \(\mathcal{SHOIQ} \)Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005); I. Horrocks and U. Sattler. A tableaux decision procedure for \(\mathcal{SHOIQ} \)Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005) · Zbl 1132.68734 |
| [17] | Horrocks, I.; Sattler, U.; Tobies, S., Practical reasoning for expressive description logics, (Ganzinger, H.; McAllester, D.; Voronkov, A., Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning. Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning, (LPAR’99). Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning. Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning, (LPAR’99), Lecture Notes in Artificial Intelligence, number 1705 (1999), Springer), 161-180 · Zbl 0947.68134 |
| [18] | Horrocks, I.; Sattler, U.; Tobies, S., Reasoning with individuals for the description logic \(SHIQ\), (McAllester, D., Proc. of the 17th Int. Conf. on Automated Deduction. Proc. of the 17th Int. Conf. on Automated Deduction, (CADE 2000). Proc. of the 17th Int. Conf. on Automated Deduction. Proc. of the 17th Int. Conf. on Automated Deduction, (CADE 2000), Lecture Notes in Computer Science, volume 1831 (2000), Springer), 482-496 · Zbl 0963.68197 |
| [19] | I. Horrocks and S. Tessaris. A conjunctive query language for description logic ABoxes. In Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI 2000); I. Horrocks and S. Tessaris. A conjunctive query language for description logic ABoxes. In Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI 2000) |
| [20] | U. Hustadt, B. Motik, and U. Sattler. Reducing SHIQ-description logic to disjunctive datalog programs. In Proc. of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2004); U. Hustadt, B. Motik, and U. Sattler. Reducing SHIQ-description logic to disjunctive datalog programs. In Proc. of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2004) |
| [21] | Y. Kazakov and B. Motik. A resolution-based decision procedure for \(\mathcal{SHOIQ} IJCAR-06 \); Y. Kazakov and B. Motik. A resolution-based decision procedure for \(\mathcal{SHOIQ} IJCAR-06 \) · Zbl 1222.68383 |
| [22] | M. Lenzerini and A. Schaerf. Concept languages as query languages. In Proc. of the 9th Nat. Conf. on Artificial Intelligence (AAAI’91); M. Lenzerini and A. Schaerf. Concept languages as query languages. In Proc. of the 9th Nat. Conf. on Artificial Intelligence (AAAI’91) |
| [23] | D.L. McGuinness and J.R. Wright. An industrial strength description logic-based configuration platform. IEEE Intelligent Systems; D.L. McGuinness and J.R. Wright. An industrial strength description logic-based configuration platform. IEEE Intelligent Systems |
| [24] | B. Motik, U. Sattler, and R. Studer. Query answering for OWL-DL with rules. In Proc. of the 3rd Int. Semantic Web Conf. (ISWC’04); B. Motik, U. Sattler, and R. Studer. Query answering for OWL-DL with rules. In Proc. of the 3rd Int. Semantic Web Conf. (ISWC’04) |
| [25] | M.M. Ortiz, D. Calvanese, and T. Eiter. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI’06); M.M. Ortiz, D. Calvanese, and T. Eiter. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI’06) · Zbl 1154.68102 |
| [26] | Pacholski, L.; Szwast, W.; Tendera, L., Complexity of two-variable logic with counting, (Proc. of the 12th IEEE Symp. on Logic in Computer Science. Proc. of the 12th IEEE Symp. on Logic in Computer Science, (LICS’97) (1997), IEEE Computer Society Press), 318-327 |
| [27] | Pan, J.; Horrocks, I., Web ontology reasoning with datatype groups, (Fensel, D.; Sycara, K.; Mylopoulos, J., Proc. of the 2003 International Semantic Web Conference. Proc. of the 2003 International Semantic Web Conference, (ISWC 2003). Proc. of the 2003 International Semantic Web Conference. Proc. of the 2003 International Semantic Web Conference, (ISWC 2003), Lecture Notes in Computer Science, number 2870 (2003), Springer), 47-63 |
| [28] | Schaerf, A., Reasoning with individuals in concept languages, Data Knowledge Engineering, 13, 2, 141-176 (1994) |
| [29] | K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91); K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91) · Zbl 0742.68059 |
| [30] | E. Sirin, B. Parsia, B. Cuenca Grau, A. Kalyanpur, and Y. Katz. Pellet: A practical owl-dl reasoner. Submitted for publication to Journal of Web Semantics, 2005; E. Sirin, B. Parsia, B. Cuenca Grau, A. Kalyanpur, and Y. Katz. Pellet: A practical owl-dl reasoner. Submitted for publication to Journal of Web Semantics, 2005 |
| [31] | S. Tessaris. Questions and Answers: Reasoning and Querying in Description Logic; S. Tessaris. Questions and Answers: Reasoning and Querying in Description Logic |
| [32] | Tobies, S., The complexity of reasoning with cardinality restrictions and nominals in expressive description logics, J. of Artificial Intelligence Research, 12, 199-217 (2000) · Zbl 0941.03029 |
| [33] | S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation; S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation |
| [34] | D. Tsarkov and I. Horrocks. FaCT++ description logic reasoner: System description. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006); D. Tsarkov and I. Horrocks. FaCT++ description logic reasoner: System description. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006) |
| [35] | Vardi, M. Y., Why is modal logic so robustly decidable, (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 31 (1997), American Mathematical Society), 149-184 · Zbl 0881.03012 |
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.
