Dense Time Logic Programming
作者单位: 1Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, 76, India
刊名: Journal of Symbolic Computation, 1996, Vol.22 (5), pp.585-613
来源数据库: Elsevier Journal
DOI: 10.1006/jsco.1996.0067
原始语种摘要: Abstract(#br)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 clauses that represent temporal facts, rules and queries. Temporal resolution tries to prove temporal queries from a set of temporal...
全文获取路径: Elsevier  (合作)
影响因子:0.391 (2012)