Logic programming based matching | |
| Author | Nguyen Trung Lap |
| Call Number | AIT Thesis no.CS-08-15 |
| Subject(s) | Logic programming Matching theory |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering in Computer Science |
| Publisher | Asian Institute of Technology |
| Abstract | Matching has been used in many applications, especially in e-commerce. There are some approaches for matching, such as ontology, similarity, preference. In addition, there are some ranking algorithms for those approaches. However, all of those approaches just care about a particular application domain like web service matching, and they also have some shortcomings which emerge when we apply those approaches to real applications. In this work, we try to propose a combination approach which includes logic programming, description logic, and user preference handling. We specify the algorithms and system architecture for a general model; therefore, it is simple for particular applications customization and implementation. Finally, a match engine is implemented in logic programming (Prolog), and this engine is used for a job matching as well. According to this approach, matching of objects is based on the matching of their attributes, and matching attributes is executed by matching their values. Finally, the values are matched by reasoning. Each object has some attributes which may have more than one value, and each value has a corresponding weight factor which handles user preference. |
| Year | 2008 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung; |
| Examination Committee(s) | Bohez, Erik;Vatcharaporn Esichaikul; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2008 |