Abstract
In this paper, we introduce a meeting scheduling system based on open constraint programming (OCP) paradigm. OCP is an extension to constraint logic programming (CLP), where a server capable of executing constraint logic programs acts as a mediator of communicating reactive agents. A meeting among several users can be scheduled automatically by a constraint logic program in the server based on the meeting participants’ preferences. Flexible user preferences can be programmed using the OCP reactors language. CLP is suitable to be used in meeting scheduling which is a combinatorial problem. Its declarative programmability is more amenable to changes.
Cite
CITATION STYLE
Qili Zhu, K., & Santosa, A. E. (2002). A meeting scheduling system based on open constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2348, pp. 792–796). Springer Verlag. https://doi.org/10.1007/3-540-47961-9_69
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
