CORR
1998
Springer
13 years 4 months ago
1998
Springer
CORR
1998
Springer
13 years 4 months ago
1998
Springer
CORR
1998
Springer
13 years 4 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
CORR
1998
Springer
13 years 4 months ago
1998
Springer
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
This paper presents the results of using Roget's International Thesaurus as the taxonomy in a semantic similarity measurement task. Four similarity metrics were taken from th...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
The purpose of this paper is to explore some semantic problems related to the use of linguistic ontologies in information systems, and to suggest some organizing principles aimed ...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...