Name
Abstract | ||
|---|---|---|
Research in Artificial Intelligence on constraint-based representations for temporal reasoning has largely concentrated on two kinds of formalisms: systems of simple linear inequalities to encode metric relations between time points, and systems of binary constraints in Allen's temporal calculus to encode qualitative relations between time intervals. Each formalism has certain advantages. Linear inequalities can represent dates, durations, and other quantitive information; Allen's qualitative calculus can express relations between time intervals, such as disjointedness, that are useful for constraint-based approaches to planning. In this paper we demonstrate how metric and Allenstyle constraint networks can be integrated in a constraint-based reasoning system. The highlights of the work include a simple but powerful logical language for expressing both quantitative and qualitative information; translation algorithms between the metric and Allen sublanguages that entail minimal loss of information; and a constraint-propagation procedure for problems expressed in a combination of metric and Allen constraints. |
Year | Venue | Keywords |
|---|---|---|
1991 | AAAI | qualitative information,constraint-based representation,qualitative relation,qualitative calculus,quantitive information,constraint-based approach,allen constraint,time interval,qualitative temporal reasoning,constraint-based reasoning system,metric relation,artificial intelligent,automated reasoning,constraint satisfaction |
Field | DocType | ISBN |
ENCODE,Computer science,Artificial intelligence,Formalism (philosophy),Reasoning system,Linear inequality,Rotation formalisms in three dimensions,Machine learning,Binary number,Qualitative reasoning | Conference | 0-262-51059-6 |
Citations | PageRank | References |
116 | 12.95 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henry A. Kautz | 1 | 9271 | 1010.27 |
| Peter B. Ladkin | 2 | 626 | 90.51 |