3758 search results - page 204 / 752 » A Complete Subsumption Algorithm |
156
click to vote
CICLING
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word...
139
click to vote
ISER
2000
Springer
15 years 9 months ago
2000
Springer
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
143
click to vote
AIML
2004
15 years 7 months ago
2004
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...
121
click to vote
ACL
2006
15 years 7 months ago
2006
We present an algorithm which creates a German CCGbank by translating the syntax graphs in the German Tiger corpus into CCG derivation trees. The resulting corpus contains 46,628 ...
149
click to vote
DLOG
2001
15 years 7 months ago
2001
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized ...