Please use this identifier to cite or link to this item:
|Title:||Dense time logic programming|
|Publisher:||ACADEMIC PRESS LTD|
|Citation:||JOURNAL OF SYMBOLIC COMPUTATION, 22(5-6), 585-613|
|Abstract:||In this paper, we describe a dense temporal logic programming (DTLP) framework based on infinite binary trees called omega trees. We then look at an important subset of omega trees called ordinal trees that represent only meaningful dense time models. Ordinal trees have the properties of stability and recurrence, which allow them to be represented finitely. The finite representations called ordinal structures can be used as temporal data structures and its nodes can be labelled with formulae, giving us the basis for modeling temporally located information. In this paper, we label ordinal structure nodes with Prolog clauses to get temporal horn cla uses that represent temporal facts, rules and queries. Temporal resolution tries to prove temporal queries from a set of temporal facts and rules using a process called aligning which provides the counterpart of the conventional unification algorithm. Aligning restructures ordinal trees to facilitate the transfer of temporal information between them. We present theoretical results to show that aligning is computable, and that the procedures for aligning and resolution are correct. (C) 1996 Academic Press Limited.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.