Show simple item record

dc.contributor.authorArtale A
dc.contributor.authorFranconi E
dc.contributor.editor
dc.date2017-03-22T00:00:00Z
dc.date.accessioned2017-03-27T09:04:17Z
dc.date.available2017-03-27T09:04:17Z
dc.date.issued2002
dc.identifier.isbn3-540-44190-5
dc.identifier.issn0302-9743
dc.identifier.urihttp://dx.doi.org/10.1007/3-540-45757-7-9
dc.identifier.urihttp://link.springer.com/chapter/10.1007/3-540-45757-7_9
dc.identifier.urihttp://hdl.handle.net/10863/1918
dc.description.abstractThis paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear temporal logic with Since and Until. We define a query language (where queries are non-recursive Datalog programs and atoms are complex DLRus expressions) and investigate the problem of checking query containment under the constraints defined by DLRus conceptual schemas - i.e., DLRus knowledge bases - as well as the problems of schema satisfiability and logical implicationen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture Notes in Computer Science;
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/3-540-45757-7-9
dc.titleA temporal description logic for reasoning over conceptual schemas and queriesen_US
dc.typeBook chapteren_US
dc.date.updated2017-03-24T07:46:59Z
dc.publication.titleEuropean Conference on Logics in Artificial Intelligence (JELIA'02)
dc.language.isiEN-GB
dc.description.fulltextopenen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record