TY - JFULL AU - André Trudel and Haiyi Zhang PY - 2007/1/ TI - Finding a Solution, all Solutions, or the Most Probable Solution to a Temporal Interval Algebra Network T2 - International Journal of Computer and Information Engineering SP - 3988 EP - 3993 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/6645 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 12, 2007 N2 - 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 all the solutions, is solving probabilistic IA networks. ER -