Name
Abstract | ||
|---|---|---|
We work in a calculus of intervals, formulated by James Allen for convex intervals, and by ourselves for unions of convex intervals [All2,Lad2]. We investigate the primitive relations and operations needed for implementing such calculi in a system which includes some set theory, and which allows the assertional definition of operators in Horn clause fashion. We indicate how standard temporal logic may be rephrased in the interval calculus, and present a formalisation of a system of time units in the interval framework. We are implementing the primitives in the REFINETM system. |
Year | Venue | Field |
|---|---|---|
1986 | AAAI | Set theory,Mathematical optimization,Horn clause,Computer science,Algorithm,Regular polygon,Theoretical computer science,Operator (computer programming),Temporal logic,Unit of time |
DocType | Citations | PageRank |
Conference | 43 | 6.18 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter B. Ladkin | 1 | 626 | 90.51 |