Abstract
A PErsonalized Tourist INformation Advisor is presented, called PETINA, which is a system aiming at constructing tours that satisfy constraints specified by tourists. The system consults a database which contains information about activities, events and sites that refer to Greece. PETINA takes as input user wishes about tour generation expressed as constraints over visits' properties and its output is tours satisfying these constraints. The user wishes may be stated using either a formal language or a graphical interface. The method of computation applies to any problem domain, in case the problem involves combinatorial searching under some kinds of constraints that can be classified into some well defined categories. Although a logic programming approach is suitable and valuable for the formulation of combinatorial search problems, conventional Prolog systems fail to cope with them efficiently. PETINA has been implemented in the ElipSys language, which is a parallel logic programming system extended with various porwerful mechanisms to allow efficient execution. Most of the ElipSys' features were proved to be indispensable for handling the complexity of the encountered problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
