We introduce description logic (DL) Knowledge and Action Bases (KAB), a mechanism that provides both a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to change such information over time, possibly introducing new objects. We resort to a variant of DL-Lite where UNA is not enforced and where equality between objects may be asserted and inferred. Actions are specified as sets of conditional effects, where conditions are based on epistemic queries over the KB (TBox and ABox), and effects are expressed in terms of new ABoxes. We address the verification of temporal properties expressed in a variant of first-order μ-calculus where a controlled form of quantification across states is allowed. Notably, we show decidability of verification, under a suitable restriction inspired by the notion of weak acyclicity in data exchange. © 2012 The Author(s).
Verification of description logic Knowledge and Action Bases / Babak Bagheri, Hariri; Diego, Calvanese; DE GIACOMO, Giuseppe; DE MASELLIS, Riccardo; Felli, Paolo; Marco, Montali. - 242:(2012), pp. 103-108. (Intervento presentato al convegno ECAI 2012 - 20th European Conference on Artificial Intelligence.) [10.3233/978-1-61499-098-7-103].
Verification of description logic Knowledge and Action Bases
DE GIACOMO, Giuseppe;DE MASELLIS, RICCARDO;FELLI, PAOLO;
2012
Abstract
We introduce description logic (DL) Knowledge and Action Bases (KAB), a mechanism that provides both a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to change such information over time, possibly introducing new objects. We resort to a variant of DL-Lite where UNA is not enforced and where equality between objects may be asserted and inferred. Actions are specified as sets of conditional effects, where conditions are based on epistemic queries over the KB (TBox and ABox), and effects are expressed in terms of new ABoxes. We address the verification of temporal properties expressed in a variant of first-order μ-calculus where a controlled form of quantification across states is allowed. Notably, we show decidability of verification, under a suitable restriction inspired by the notion of weak acyclicity in data exchange. © 2012 The Author(s).File | Dimensione | Formato | |
---|---|---|---|
VE_2012_11573-484863.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
289.5 kB
Formato
Adobe PDF
|
289.5 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.