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 all
the solutions, is solving probabilistic IA networks.
Abstract: E-Appointment Scheduling (EAS) has been developed
to handle appointment for UMP students, lecturers in Faculty of
Computer Systems & Software Engineering (FCSSE) and Student
Medical Center. The schedules are based on the timetable and
university activities. Constraints Logic Programming (CLP) has been
implemented to solve the scheduling problems by giving
recommendation to the users in part of determining any available
slots from the lecturers and doctors- timetable. By using this system,
we can avoid wasting time and cost because this application will set
an appointment by auto-generated. In addition, this system can be an
alternative to the lecturers and doctors to make decisions whether to
approve or reject the appointments.