𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A unifying approach to temporal constraint reasoning

✍ Scribed by Peter Jonsson; Christer Bäckström

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
956 KB
Volume
102
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis

We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs, which have a polynomial-time satisfiability problem. We prove that most approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn algebra by Nebel and Btirckert and the simple temporal constraints by Dechter et al. Thus, DLRs is a suitable unifying formalism for reasoning about temporal constraints.

📜 SIMILAR VOLUMES

Episode analysis: A practical approach f
Episode analysis: A practical approach for temporal reasoning in automated processes
✍ S. Parthasarathy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 777 KB

Temporal relationships have a major practical importance in specifying, designing and analysing automated processes. This paper presents a practical approach called episode analysis, for representing temporal knowledge, and describes the various situations in which it can be useful. Outlines of a pr

An intensional approach to qualitative a
An intensional approach to qualitative and quantitative periodicity-dependent temporal constraints
✍ Luca Anselma; Stefania Montani; Paolo Terenziani 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

In this paper, we propose a framework for representing and reasoning about qualitative and quantitative temporal constraints between periodic events. In particular, our contribution is twofold: (i) we provide a formalism to deal with both qualitative and quantitative "periodicity-dependent" constrai

A knowledge server for reasoning about t
A knowledge server for reasoning about temporal constraints between classes and instances of events
✍ Paolo Terenziani; Luca Anselma 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB

Reasoning with temporal constraints is a ubiquitous issue in many computer science tasks, for which many dedicated approaches have been and are being built. In particular, in many areas, including planning, workflow, guidelines, and protocol management, one needs to represent and reason with tempora