Hybrid temporal reasoning for planning and scheduling

Author

Badaloni, Silvana ; Berati, Marina

Author_Institution

Dept. of Electron. & Comput. Sci., Padova Univ., Italy

fYear

1996

fDate

19-20 May 1996

Firstpage

39

Lastpage

44

Abstract

This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal information and their complexity

Keywords

computational complexity; constraint handling; knowledge representation; planning (artificial intelligence); process algebra; scheduling; temporal logic; temporal reasoning; IDSA; algorithm complexity; heterogeneous temporal information representation; homogeneous representation; hybrid temporal reasoning; interval-distance sub-algebra; metric information; planning; qualitative information; scheduling; temporal constraint network; temporal information propagation; Algebra; Algorithm design and analysis; Computer science; Hybrid power systems; Information analysis; Logic functions; Performance analysis; Power system planning; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Temporal Representation and Reasoning, 1996. (TIME '96), Proceedings., Third International Workshop on

Conference_Location

Key West, FL

Print_ISBN

0-8186-7528-4

Type

conf

DOI

10.1109/TIME.1996.555674

Filename

555674