Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
NoA is an agent architecture that supports the development of agents motivated by norms: obligations, permissions and prohibitions. Obligations motivate a normative agent to act: ...
The benefits of modular representations arc well known from many areas of computer science. In this paper, we concentrate on the benefits of modular ontologies with respect to loc...