Finding the most probable solution to a probabilistic temporal interval algebra network

Authors:
Haiyi Zhang;André Trudel
Affiliations:
Jodrey School of Computer Science, Acadia University, Wolfville, Nova Scotia, Canada;Jodrey School of Computer Science, Acadia University, Wolfville, Nova Scotia, Canada
Venue:
NN'06 Proceedings of the 7th WSEAS International Conference on Neural Networks
Year:
2006

Citing 3
Cited 0

Towards a general theory of action and time

Artificial Intelligence
A Local Search Approach to Modelling and Solving Interval Algebra Problems

Journal of Logic and Computation
The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Over the years, many implementations have been proposed for solving IA networks. These implementations are concerned with finding a solution efficiently. The primary goal of our implementation is simplicity and ease of use. We present an IA network implementation based on finite domain non-binary CSPs, and constraint logic programming. The implementation has a GUI which permits the drawing of arbitrary IA networks. We then show how the implementation can be extended to find all the solutions to an IA network. One application of finding most probable solution is solving probabilistic IA networks.