Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
This chapter gives an overview of our ongoing experimental research in the MeMoSpace project, concerning the cognitive processes underlying human spatial reasoning. Our theoretical...
Markus Knauff, Reinhold Rauh, Christoph Schlieder,...
Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar ...
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...