Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Abstract. We present an overview of different theories of explanation from the philosophy and cognitive science communities. Based on these theories, as well as models of explanati...
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
Traditionally, consistency is the only criterion for the quality of a theory in logicbased approaches to reasoning about actions. This work goes beyond that and contributes to the...
This paper discusses a novel data mining system devised and developed at Birmingham, which attempts to provide a more effective data mining system. It ties in with the workshop go...