# Temporal constraint networks

##### Citations

1,739 citations

1,527 citations

1,420 citations

1,069 citations

### Cites background from "Temporal constraint networks"

...…and Ranganathan 1990; Fox 1987; Fox, Sadeh, and Baykan 1989; Petrie et al. 1989; Prosser 1989; Rit 1986), temporal reasoning (Allen 1983, 1984; Dechter, Meiri, and Pearl 1991; Vilain and Kautz 1986; Tsang 1987), graph problems (McGregor 1979; Bruynooghe 1985), floor plan design (Eastman…...

[...]

...Some examples are machine vision (Chakravarty 1979; Davis and Rosenfeld 1981; Mackworth 1977b; Montanari 1974; Hummel 1976), belief maintenance (Dechter 1987; Dechter and Pearl 1988b; Dhar and Croker 1990), scheduling (Dhar and Ranganathan 1990; Fox 1987; Fox, Sadeh, and Baykan 1989; Petrie et al. 1989; Prosser 1989; Rit 1986), temporal reasoning (Allen 1983, 1984; Dechter, Meiri, and Pearl 1991; Vilain and Kautz 1986; Tsang 1987), graph ......

[...]

785 citations

##### References

9,262 citations

7,466 citations

### "Temporal constraint networks" refers background in this paper

...where [1], [2] and [3] stand for the three admissible colors....

[...]

...It seems likely, however, that unless metric constraints are specified, the representation suggested in [2] can be handled more conveniently....

[...]

...{[1, 2], (6, 8)} ® {[0, 3), (12, 15]} = {[1, 5), (6, 11), (13, 17], (18, 23)}....

[...]

...Several formalisms for expressing and reasoning about temporal knowledge have been proposed, most notably, Allen's interval algebra [2], Vilain and Kautz's point algebra [49], linear inequalities (Malik and Binford [33], Vald6s-P6rez [46]), and Dean and McDermott's time map [13]....

[...]

...X 4, each having a domain {[1], [2], [3]}, connected by six binary constraints X, - X i E {[-2], [-1], [11, [2]}, (5....

[...]

7,362 citations

7,221 citations

### "Temporal constraint networks" refers methods in this paper

...The d-graph of an STP can be constructed by applying Floyd-Warshall's all-pairs-shortest-paths algorithm [38] to the distance graph (see Fig....

[...]

2,750 citations

### "Temporal constraint networks" refers background or methods in this paper

...See also [11, 31,36] for additional relationships between shortest paths algorithms and path consistency....

[...]

...ing intersection first, and then composition, we get To1 ® (T13 ~ 513 ) "~- {[0, 11, [10, 20]} ® {[25, 30], [40, 50]} = {[25, 31], [35, 70]}....

[...]

...Using the operations q) and ® (denoting intersection and composition), Montanari's path consistency algorithm (equivalent to Mackworth's [31] PC-l) is shown in Fig....

[...]

...Pursuing its traditional role [31, 36], path consistency in the context of a TCSP is defined as follows:...

[...]

...A more efficient path consistency algorithm is the temporal equivalent of Mackworth's PC-2 [31], shown in Fig....

[...]