Abstract
We present a unified approach for finding a single, all, or the most probable solution to an Interval Algebra network. The network may contain finite, non-finite, or a mixture of both types of temporal intervals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Towards a general model of action and time. Artificial Intelligence 23(2), 123–154 (1984)
ECLiPSe, http://www.eclipse-clp.org/
Fruhwirth, T.: Temporal reasoning with constraint handling rules. Technical report ECRC-94-05, European computer-industry research centre, Germany (1994)
JGraph, http://www.jgraph.com/
Lamma, E., Milano, M., Mello, P.: Temporal reasoning in a meta constraint logic programming architecture. In: Third international workshop on temporal representation and reasoning (TIME 1996), Florida, pp. 128–135 (1996)
Ligozat, G.: Weak representations of interval algebras. In: 8th National Conference on Artificial Intelligence (AAAI 1990), Boston, USA, pp. 715–720 (1990)
Pham, D.N., Thornton, J., Sattar, A.: Modelling and solving temporal reasoning as propositional satisfiability. Artificial Intelligence 172(15), 1752–1782 (2008)
Ryabov, V., Trudel, A.: Probabilistic Temporal Interval Networks. In: 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), Tatihou Island, France, pp. 64–67 (2004)
Thornton, J., Beaumont, M., Sattar, A., Maher, M.: A local search approach to modeling and solving interval algebra problems. Journal of logic and computation 4(1), 93–112 (2004)
Trudel, A.: How to convert a qualitative temporal CSP into a finite domain binary CSP. In: Spatial and Temporal Reasoning workshop held during the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, pp. 121–124 (2003)
Trudel, A., Zhang, H.: Exploiting the relationship between IA networks and finite domain CSPs. In: 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), Vermont, USA, pp. 177–179 (2005)
Trudel, A.: Finding all the solutions to an IA network. In: Workshop on Spatial and Temporal Reasoning held during IJCAI 2005, Edinburgh, Scotland, pp. 71–76 (2005)
van Beek, P., Manchak, D.W.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4, 1–18 (1996)
Zhang, K., Trudel, A.: Efficient heuristics for solving probabilistic interval algebra networks. In: The 13th International Symposium on Temporal Representation and Reasoning (TIME 2006), Budapest, Hungary, pp. 111–118 (2006)
Trudel, A.: Interval Algebra networks with infinite intervals. In: 16th International Symposium on Temporal Representation and Reasoning (TIME 2009), Bressanone-Brixen, Italy, pp. 141–146 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trudel, A. (2010). Finding a Single, All, or the Most Probable Solution to a Finite or Non-finite Interval Algebra Network. In: Farzindar, A., Kešelj, V. (eds) Advances in Artificial Intelligence. Canadian AI 2010. Lecture Notes in Computer Science(), vol 6085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13059-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-13059-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13058-8
Online ISBN: 978-3-642-13059-5
eBook Packages: Computer ScienceComputer Science (R0)