A new proof of tractability for ORD-horn relations

Conference · Tue Dec 31 00:00:00 EST 1996

OSTI ID:430686

Ligozat, G ^[1]

---

1. Universite Paris-Sud, Orsay (France)

This paper gives an elementary proof of the tractability of a sub-class of temporal relations in Allen`s algebra and related temporal calculi, the class of pre-convex relations. In Allen`s case, this subclass coincides with the class of ORD-Horn relations. Nebel and Burckert defined ORD-Horn relations and proved that path-consistency is a sufficient condition for consistency of a network for this sub-class. We prove a stronger result: for each path-consistent network in the sub-class, we give an effective method for constructing a feasible scenario without backtrack.

• OSTI ID: 430686
• Report Number(s): CONF-960876-; TRN: 96:006521-0061
• Resource Relation: Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
DECISION MAKING
ALGORITHMS
ARTIFICIAL INTELLIGENCE
ALGEBRA