445 search results - page 3 / 89 » A Systematic Construction of Abstract Domains |
SAS
2009
Springer
14 years 6 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
CP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...
AAAI
2007
13 years 8 months ago
2007
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
AI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
UAI
2003
13 years 7 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...