3446 search results - page 72 / 690 » A Reasoning Algorithm for pD* |
113
click to vote
JAR
2007
15 years 1 months ago
2007
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
142
click to vote
ACL
1994
15 years 2 months ago
1994
We present a stochastic finite-state model for segmenting Chinese text into dictionary entries and productively derived words, and providing pronunciations for these words; the me...
CADE
1999
Springer
15 years 5 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
DLOG
2010
14 years 11 months ago
2010
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...