We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henkin-style semantics. Our study starts from the observation that the various possibilities of adding higher-order constructs to a DL form a spectrum of increasing expressive power, including domain metamodeling, i.e., using concepts and roles as predicate arguments. We argue that higher-order features of this type are sufficiently rich and powerful for the modeling requirements arising in many relevant situations, and therefore we carry out an investigation of the computational complexity of satisfiability and conjunctive query answering in DLs extended with such higher-order features. In particular, we show that adding domain metamodeling capabilities to script Sscript Hscript Iscript Q (the core of OWL 2) has no impact on the complexity of the various reasoning tasks. This is also true for DL-Litescript R (the core of OWL 2 QL) under suitable restrictions on the queries. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
Higher-order description logics for domain metamodeling / DE GIACOMO, Giuseppe; Lenzerini, Maurizio; Rosati, Riccardo. - 1:(2011), pp. 183-188. (Intervento presentato al convegno 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11 tenutosi a San Francisco, CA nel 7 August 2011 through 11 August 2011).
Higher-order description logics for domain metamodeling
DE GIACOMO, Giuseppe;LENZERINI, Maurizio;ROSATI, Riccardo
2011
Abstract
We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henkin-style semantics. Our study starts from the observation that the various possibilities of adding higher-order constructs to a DL form a spectrum of increasing expressive power, including domain metamodeling, i.e., using concepts and roles as predicate arguments. We argue that higher-order features of this type are sufficiently rich and powerful for the modeling requirements arising in many relevant situations, and therefore we carry out an investigation of the computational complexity of satisfiability and conjunctive query answering in DLs extended with such higher-order features. In particular, we show that adding domain metamodeling capabilities to script Sscript Hscript Iscript Q (the core of OWL 2) has no impact on the complexity of the various reasoning tasks. This is also true for DL-Litescript R (the core of OWL 2 QL) under suitable restrictions on the queries. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.File | Dimensione | Formato | |
---|---|---|---|
VE_2011_11573-416354.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
316.19 kB
Formato
Adobe PDF
|
316.19 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.