Abstract. Here we introduce DePathos, a graphical tool for a timetabling constraint engine (Pathos). Since the core of Pathos is textbased and provides little user-interaction, fi...
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
We discuss description and reasoning over regions. We have proposed a system called SRCC that integrates integration of spatial and semantic data. SRCC can describe and reason abo...
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...