193 search results - page 26 / 39 » A Tractable Class of Abduction Problems |
IJCAI
2003
14 years 10 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
PODS
2001
ACM
15 years 9 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
AI
2003
Springer
15 years 2 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...