Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001

16-16 June 2001

Filter Results

Displaying Results 1 - 25 of 35
  • Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001

    Publication Year: 2001
    Request permission for reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • Cellular ontology as a basis for spatiotemporal reasoning

    Publication Year: 2001, Page(s):3 - 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (191 KB) | HTML iconHTML

    A logic for reasoning about dynamic systems should be defined on three levels. The material level is expressed in quantitative terms, the image level defines models in terms of discrete mathematics, and the logic level defines the logical language and deduction system. Consider the problem of guiding a vehicle that has to move within severe spatial constraints. For a simple version of a cellular o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Event Calculus assessed

    Publication Year: 2001, Page(s):7 - 12
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (555 KB) | HTML iconHTML

    The range of applicability of the Full Event Calculus is proven to be the Ksp-IA class in the features and fluents taxonomy. The proof is given with respect to the original definition of this preference logic, where no adjustments of the language or reasoning method were necessary. The result implies that the claims on the expressiveness and problem-solving power of this logic were indeed correct. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of temporal intervals and relations: information visualization aspects and their evaluation

    Publication Year: 2001, Page(s):13 - 20
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (911 KB) | HTML iconHTML

    A crucial component for turning any temporal reasoning system into a real-world application that can be adopted by a wide base of users is given by its user interface. After analyzing and discussing the state of the art for the visualization of temporal intervals and relations, this paper proposes three new solutions, also evaluating them with a proper user study. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping temporal planning constraints into timed automata

    Publication Year: 2001, Page(s):21 - 27
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    Planning and model checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal reasoning with aspectual adverbs

    Publication Year: 2001, Page(s):28 - 34
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (601 KB) | HTML iconHTML

    Our central aim is to account for the validity of reasoning patterns involving focus adverbs in contexts where the temporal reference point may change during the process of interpretation of the premises. This paper proposes a dynamic semantics of such temporal inferences, determining what is updated in the interpretation and what information is preserved. In order to capture the various informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic reasoning about uncertain relations between temporal points

    Publication Year: 2001, Page(s):35 - 40
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (558 KB) | HTML iconHTML

    A wide range of AI applications should manage time varying information. Many published research articles in the area of temporal representation and reasoning assume that temporal data is precise and certain, even though in reality this assumption is often false. However, in many real applications temporal information is imperfect and there is a need to find some way of handling it. An uncertain re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal reasoning: an application to normative systems

    Publication Year: 2001, Page(s):41 - 47
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (646 KB) | HTML iconHTML

    We propose a first-order model as a possible formal basis for normative agent systems (NAS). The model allows us to describe the execution of actions in time and the use of dynamic norms. We also present its operational aspect which is based on the reduction of the deontic constraints to temporal ones. In order to show the applicability of the model we briefly describe a logic programming implemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualitative temporal representation and reasoning about points, intervals and durations

    Publication Year: 2001, Page(s):51 - 56
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (538 KB) | HTML iconHTML

    An elegant framework called INDU (Pujari et al., Proc. Australian Conf. AI, 1999) has been proposed for representing qualitative information about time intervals and durations. INDU is a single network, therefore it avoids typical problems of bi-networks, and in addition it has interesting computational properties. We extend INDU in two directions: we enrich its expressive power introducing points... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about the temporal aspects of interacting agents

    Publication Year: 2001, Page(s):57 - 62
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (489 KB) | HTML iconHTML

    The formalization of temporal reasoning for dealing with actions taking place at different grains of time has been investigated in the recent years. The main concern has been the representation of the real calendar and the mechanisms needed for mapping events "annotaded" with any convex an non-convex intervals to their annotation in the calendar. This work presents some results on the representati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning preferences on temporal constraints: a preliminary report

    Publication Year: 2001, Page(s):63 - 68
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    A number of reasoning problems involving the manipulation of temporal information can naturally be viewed as implicitly inducing an ordering of potential local decisions involving time (specifically, associated with durations or orderings of events) on the basis of preferences. For example, a pair of events might be constrained to occur in a certain order and, in addition, it might be preferable t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating uncertain relations between indeterminate temporal points and intervals

    Publication Year: 2001, Page(s):69 - 74
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (572 KB) | HTML iconHTML

    In many applications of temporal representation and reasoning formalisms there is a need to deal with temporal relations. Many published approaches assume that the temporal information available is precise and certain, although in reality this is not always true. Therefore, we need to find some way of handling imperfect temporal information. We propose one way to represent uncertain relations betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Best time and content for delay notification

    Publication Year: 2001, Page(s):75 - 80
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (510 KB) | HTML iconHTML

    We consider an active information system, which aims to notify a traveler timely about a likely delay. Besides providing the right content, it should also wait for the best time for notification. This is especially true for mobile information services, where every notification may irritate the recipient. We formulate and solve such a problem involving best choices both for content and time of noti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing temporal interval relationships in a first order logic for time

    Publication Year: 2001, Page(s):81 - 86
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    We present a simple classification of temporal information based on truth value at the point level. Axioms are then derived for capturing temporal relationships and, strong and weak negation. The main advantage of our logic independent approach is that it becomes simpler for a user to define a first order temporal logic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatiotemporal databases: recent achievements and opportunities for future research

    Publication Year: 2001, Page(s): 89
    Request permission for reuse | PDF file iconPDF (22 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing temporal queries: efficient handling of duplicates

    Publication Year: 2001, Page(s):93 - 100
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (745 KB) | HTML iconHTML

    Recent research in the area of temporal databases has proposed a number of query languages that vary in their expressive power and the semantics they provide to users. These query languages represent a spectrum of solutions to the tension between clean semantics and efficient evaluation. Often, these query languages are implemented by translating temporal queries into standard relational queries. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A query calculus for spatio-temporal object databases

    Publication Year: 2001, Page(s):101 - 110
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1022 KB) | HTML iconHTML

    The development of any comprehensive proposal for spatio-temporal databases involves significant extensions to many aspects of a non-spatio-temporal architecture. One aspect that has received less attention than most is the development of a query calculus that can be used to provide a semantics for spatio-temporal queries and underpin an effective query optimization and evaluation framework. We sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering calendar-based temporal association rules

    Publication Year: 2001, Page(s):111 - 118
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    A temporal association rule is an association rule that holds during specific time intervals. An example is that eggs and coffee are frequently sold together in morning hours. The paper studies temporal association rules during the time intervals specified by user-given calendar schemas. Generally, the use of calendar schemas makes the discovered temporal association rules easier to understand. An... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal aspects of semistructured data

    Publication Year: 2001, Page(s):119 - 127
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (801 KB) | HTML iconHTML

    In many applications information about the history of data and their dynamic aspects are just as important as static information. The increasing amount of information accessible through the Web has presented new challenges to academic and industrial research on databases. In this context, data are either structured, when coming from relational or object-oriented databases, or partially or complete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expiration of historical databases

    Publication Year: 2001, Page(s):128 - 135
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (779 KB) | HTML iconHTML

    We present a technique for automatic expiration of data in a historical data warehouse that preserves answers to a known and fixed set of first-order queries. In addition, we show that for queries with output size bounded by a function of the active data domain size (the number of values that have ever appeared in the warehouse), the size of the portion of the data warehouse history needed to answ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal tableau queries

    Publication Year: 2001, Page(s):136 - 143
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (676 KB) | HTML iconHTML

    The tableau construct plays a very important role in relational-database theory. The paper shows how this construct can be extended for tuple-timestamped relations. The expressive power of temporal tableau queries is compared with that of a temporal algebra. A temporal extension of the homomorphism theorem is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Navigating through multiple temporal granularity objects

    Publication Year: 2001, Page(s):147 - 155
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (833 KB) | HTML iconHTML

    Managing and relating temporal information at different time units is an important issue in many applications and research areas, among them temporal object-oriented databases. Due to the semantic richness of the object-oriented data model, the introduction of multiple temporal granularities in such a model poses several interesting issues. In particular, object-oriented query languages provide a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linguistic framework for querying dimensional data

    Publication Year: 2001, Page(s):156 - 163
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (774 KB) | HTML iconHTML

    This paper deals with dimensional data. Examples of dimensions are space and time. Thus, temporal, spatial, spatiotemporal values are examples of dimensional data. We define the notion of dimensional object, extending an object-oriented ODMG-like type system to include dimensional types. We then address the problem of querying dimensional objects. Linguistic constructs are introduced that allow ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective representation and efficient management of indeterminate dates

    Publication Year: 2001, Page(s):164 - 169
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (612 KB) | HTML iconHTML

    Management of indeterminate temporal expressions is useful in a wide range of applications, from designing and querying temporal databases to knowledge representation and reasoning in artificial intelligence. In this paper, we focus on the representation and management of indeterminate dates, corresponding to a common use of temporal indeterminacy which can be found in (historical) texts written i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate query evaluation using linear constraint databases

    Publication Year: 2001, Page(s):170 - 175
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (501 KB) | HTML iconHTML

    This paper shows that constraint databases can be used for the approximation of several types of discretely recorded continuous data, for example time series data and some spatio-temporal geographic data. We show that time series data can be approximated by a piecewise linear approximation that runs in linear time in the number of data points, and the piecewise linear approximation can be represen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.