| A. Artale, E. Franconi, M. Mosurovi'c, Frank Wolter, and Michael Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. 2001. Submitted. |
No context found.
A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. Technical report, Dept. of Computer Science, Univ. of Manchester, UK, 2001.
No context found.
A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. Technical report, Dept. of Computer Science, Univ. of Manchester, UK, 2001.
No context found.
A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. In Proc. of the 9th Italian Database Conference (SEBD'2001), 2001.
....modelling systems. The outcome is an elegant correspondence between temporal constructs and sets of DLR US formulas. Moreover, temporal integrity constraints can be captured by additional DLR US formulas. In this paper we do not go into the details of this part; these can be found in [4]. We then investigate computational properties of reasoning with DLR US by 2 analysing schema, entity, and relation satisfiability, logical implication, and query containment for non recursive Datalog queries under constraints imposed by DLR US conceptual schemas. The full DLR US turns out ....
.... the basic description logic ALC) can encode then the undecidable tiling problem (cf. 25, 14] The fragment DLR US of DLR US deprived of this ability to talk about temporal persistence of n ary relations, for n # 2, is still very expressive, as is illustrated by examples provided in [4], but its computational behaviour is much better. We obtain the following hierarchy of complexity results: 1) reasoning in DLR US with atomic formulas is EXPTIME complete, 2) satisfiability and logical implication of arbitrary DLR US formulas is EXPSPACE complete, and (3) the problem ....
[Article contains additional citation context not shown here]
A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. Technical report, Dept. of Computer Science, Univ. of Manchester, UK, 2001.
....and (d) temporal cardinalities. Full DLR US used in (2) is able to express (a) and (b) However, c) and (d) require temporalised relations which, by Theorem 1, lead to undecidability. In this paper we do not go into the details of the proof; the complete proof can be found in a technical report [5]. The main technical tool in the proof is the method of quasimodels developed in [29, 31] The idea behind the notion of a quasimodel is to represent the state of the (in general, infinite) domain of a temporal model at a each moment of time by finitely many types of the domain objects at this ....
A. Artale, E. Franconi, M. Mosurovic, F. Wolter, and M. Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. Technical report, Dept. of Computer Science, Univ. of Manchester, UK, 2001.
No context found.
A. Artale, E. Franconi, M. Mosurovi'c, Frank Wolter, and Michael Zakharyaschev. Reasoning over conceptual schemas and queries in temporal databases. 2001. Submitted.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC