| Author | Siri Prasansantikul |
| Call Number | AIT Thesis no.CS-94-21 |
| Subject(s) | Problem solving--Data processing
|
| Note | A thesis submitted in partial fulfilment of the requirement for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | This study examines the applicability of concurrent constraint programming (CCP)
languages to the implementation of distributed problem solving (DPS) systems. DPS systems
consists of multiple intelligent agents solving problems together. A CCP language is a concurrent
language in which computational activities can be created dynamically, communicating and
synchronizing with each other through constraint mechanism. To understand better about DPS
systems, many reviews about DPS and negotiation are given. For DPS applications, concurrency
and communication are of great importance and often requirements of problems or agents are in
form of constraints. Basically, CCP languages can provide fine-grained concurrency, inherent
communication and constraint solving. To realize the suitability of the language, we investigate
through a concrete domain and a concrete CCP language, implementation of the distributed
scheduling system with Oz. We also give a comparison between Oz and IC-Prolog II, the
language which is intentionally designed as a tool for implementation of distributed applications
including DPS systems. |
| Year | 1994 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung |
| Examination Committee(s) | Kanchana Kanchanasut ;Yulu, Qi
|
| Scholarship Donor(s) | DAAD |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1994 |