Exploiting the relationship between ia networks and finite domain CSPs

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2005, Pages 177-179

  Trudel, André ^a   Zhang, Haiyi ^a  

^a ACADIA UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE DOMAINS; IA NETWORK; INTERVAL ALGEBRA; NETWORK PROBLEMS; SOLUTION TECHNIQUES;

COMPUTER OPERATING PROCEDURES;

EID: 66749190616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2005.22     Document Type: Conference Paper

References (4)

1. J.F. Allen, "Towards a general model of action and time", Artificial Intelligence, 23(2), 1984, pp. 123-154.
2. J. Thornton, M. Beaumont, A. Sattar, and M. Maher, "A local search approach to modeling and solving interval algebra problems", The journal of logic and computation, 4(1), 2004, pp. 93-112.
3. A. Trudel, "How to convert a qualitative temporal CSP into a finite domain binary CSP", Spatial and Temporal Reasoning workshop held during the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico, 2003, pp. 121-124.
4. A. Trudel, and H. Zhang, "Exploiting the relationships between IA Networks and Finite Domain CSPs: Extended version", Technical report, Acadia University, Canada, 2005.