Sciweavers

169 search results - page 18 / 34
» arcs 2007
Sort
View
IJCAI
2003
13 years 9 months ago
A lookahead strategy for solving large planning problems
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...
Vincent Vidal
BMCBI
2007
154views more  BMCBI 2007»
13 years 8 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
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...
IJCAI
2007
13 years 9 months ago
The Logic Behind Weighted CSP
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...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
IJCAI
2003
13 years 9 months ago
NoA - A Normative Agent Architecture
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: ...
Martin J. Kollingbaum, Timothy J. Norman
IJCAI
2003
13 years 9 months ago
Integrity and Change in Modular Ontologies
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...
Heiner Stuckenschmidt, Michel C. A. Klein