1383 search results - page 183 / 277 » On the Complexity of the Interlace Polynomial |
150
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
170
click to vote
AIPS
2008
15 years 8 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
166
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
131
click to vote
CCCG
2008
15 years 7 months ago
2008
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
164
click to vote
IJCAI
2007
15 years 7 months ago
2007
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...