29 search results - page 5 / 6 » Constraint Solving Specializations for Equality on an Interv... |
KI
2002
Springer
13 years 5 months ago
2002
Springer
We present an extension of state-based planning from traditional Strips to function application, allowing to express operator effects as updates. As proposed in PDDL, fluent variab...
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
TACAS
2009
Springer
14 years 17 days ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
ANOR
2005
13 years 5 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
AGP
2003
IEEE
13 years 11 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...