{"type":"ScholarlyArticle","title":"Managing Efficiently Temporal Relations Through Indexed Spanning Trees","authors":[{"name":"Malik Ghallab","slug":"malik-ghallab","given":"Malik","family":"Ghallab","affiliation":""},{"name":"A. Mounir Alaoui","slug":"a-mounir-alaoui","given":"A. Mounir","family":"Alaoui","affiliation":""}],"abstract":"We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thousand time-tokens in demanding applications such as reactive planning and execution control. A system, called IxTeT, aiming at that goal is described. It uses an original representation of a lattice of time-points that relies for efficiency on a maximum spanning tree of the lattice together with a particular indexing of its nodes. The lxTeT system is sound and complete, it has the same expressive power as the restricted Interval Algebra that permits completeness in polynomial time. Its average complexity is shown experimentally to be linear, with a low overhead constant, for both operations: retrieval in and updating of a set of temporal relations.","doi":null,"url":"https://ijcai.org/proceedings/1989/208","pdf":"https://ijcai.org/proceedings/1989/0208.pdf","markdown":"https://ijcai.org/proceedings/1989/208.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/208","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Knowledge Representation","track":"Knowledge Representation","number":208,"pages":{"first":1297,"last":1302},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}