3244 search results - page 300 / 649 » Extensions to Description Logics |
180
click to vote
LPAR
2004
Springer
15 years 12 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
191
click to vote
IJCAI
1993
15 years 8 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
229
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
170
click to vote
ECML
1998
Springer
15 years 10 months ago
1998
Springer
: Image understanding often requires extensive background knowledge. The problem addressed in this paper is such knowledge can be acquired. We discuss how relational machine learni...
111
click to vote
COLING
1994
15 years 8 months ago
1994
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...