The token reification approach to temporal reasoning

Operators vs. Arguments: The Ins and Outs of Reification

“…Reichgelt's formula implies that if we have Causes(p, q) then no instance of q can precede any instance of p, which is far too strong. This is cursorily acknowledged in a footnote in a subsequent paper by Vila and Reichgelt (1996), where they present essentially the same formulation of the cause-effect rule, and they indicate that the problem can be overcome by moving from type-reification to token-reification (see Section 7.4 below). Bacchus et al (1991), while espousing a non-reified theory (see Section 6.1), agree with Shoham that reified logics have the advantage of allowing one to quantify over propositions, thus enabling one to express "effects cannot precede their causes" -for which they suggest the formula…”

Propagating temporal relations of intervals by matrix

“…To confront this problem, traditional models are designed to improve IA. For example, a number of researches have been focused on constraint satisfactory problems (Allen and Koomen 1983;Haddawy 1996;Ladkin and Maddux 1994;Meiri 1996;Mouhoub, Charpillet, and Haton 1998;Nebel 1997;Pirri and Reiter 1995;Schwalb, Kask, and Dechter 1994;Vilain and Kautz 1986) and solving tractable subclasses of Allen' s interval algebra (Nebel and Burckert 1995;Schwalb and Dechter 1997;Schwalb 1997;Tolba, Charpillet, and Haton 1991;Vila and Reichgelt 1996). However, propagating temporal relations is still non-tractable in general (Nebel and Buckert 1995;Nebel 1997) .…”

“…They fall into abstract model termporal logics and rei® ed temporal logics. For instance, abstract model temporal logics like Templog (Abadi and Manna 1989) is based on linear and branching time temporal logics and temporal logic programming languages (Tang 1989); rei® ed temporal logics like the token rei® cation temporal logic (Halpern and Sholam 1991;Vila and Reichgelt 1996), temporal extensions and implementations (Hrycej 1993;Tang 1989;Yampratoom and Allen 1993), and more general works on temporal logic (Barringer, Kuiper, and Pnueli 1984;Staab and Hahn 1999). Certainly, there are also a number of researches on time, such as adding synchronization constraints between concurrent agents such that their concurrent execution satis® es a given temporal property (Shoham and Tennenholtz 1994;Stuart 1985), and a method for synchronizing multiagent plans from goals described by a temporal logic (Kabanza 1995), natural language understanding (Allen 1984), general planning (Allen and Koomen 1983;Haddawy 1996;Pirri and Reiter 1995), and binary constraint problems (Ladkin and Maddux 1994;Meiri 1996;Mouhoub, Charpillet, and Haton 1998;Nebel and Buckert 1995;Nebel 1997;Schwalb, Kask, and Dechter 1994;Schwalb and Dechter 1997;Schwalb 1997;Tolba, Charpillet, and Haton 1991;Vila andReichgelt 1996, Vilain andKautz 1986).…”

Patterns in World Dynamics Indicating Agency

“…Such second-order dynamic properties are expressed in MetaTTL: the meta-language of TTL. For more information on how to formalise such a meta-language, see, for example, Attardi and Simi (1984), Bowen and Kowalski (1982), Bowen (1985), Weyhrauch (1980), Vila and Reichgelt (1996). The language MetaTTL includes sorts for DYNPROP(Ont) and its subsets as indicated above, which contain TTL-statements (for dynamic properties) as objects denoted by term expressions.…”