%0 Journal Article
	%A André Trudel and  Haiyi Zhang
	%D 2007
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 12, 2007
	%T Finding a Solution, all Solutions, or the Most Probable Solution to a Temporal Interval Algebra Network
	%U https://publications.waset.org/pdf/6645
	%V 12
	%X 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.
	%P 3989 - 3993