Electronic Resource
Oxford, UK and Boston, USA
:
Blackwell Publishers Inc
Computational intelligence
15 (1999), S. 0
ISSN:
1467-8640
Source:
Blackwell Publishing Journal Backfiles 1879-2005
Topics:
Computer Science
Notes:
A critical problem for managers of temporal information is the treatment of assertions and of complex types of queries because in many cases the treatment could involve reasoning on the whole knowledge base of temporal constraints. We propose an efficient approach to this problem. First, we show how different types of queries can be answered (in a complete way) in a time polynomial in the dimension of the query and independently of the dimension of the knowledge base. Second, we provide an efficient (and complete) procedure to deal with sessions of interleaved assertions and queries to the knowledge base. We provide both analytical and experimental evaluations of our approach, and we discuss some application areas.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1111/0824-7935.00101
|
Location |
Call Number |
Expected |
Availability |
