Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
The vision of ubiquitous computing is one in which resource constrained mobile devices form ad-hoc networks to enable the delivery of services that are sensitive and responsive to...
Conor Muldoon, Gregory M. P. O'Hare, John F. Bradl...
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
An important application of both data abstraction and plan execution is the execution of clinical guidelines and protocols (CGP), both to validate them against a large set of test ...
Peter Votruba, Andreas Seyfang, Michael Paesold, S...