Abstract
This article outlines CaTTS, a language for expressing and solving multi-calendar appointment scheduling problems. The problems are formalized as Constraint Satisfaction Problems (CSPs) with variables representing finite convex intervals. The constraints on such variables are expressed as finite domain constraints.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-076

BibTeX:

@inproceedings{REWERSE-RP-2006-076,
	author = {Stephanie Spranger and Fran\c{c}ois Bry},
	title = {Multi-Calendar Appointment Scheduling: Calendar Modeling and Constraint Reasoning},
	booktitle = {Proceedings of 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, Czech Republic (30th August--1st September 2006)},
	year = {2006},
	pages = {496--501},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-076}
}