2152 search results - page 217 / 431 » On Automating the Calculus of Relations |
171
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
162
click to vote
ICCBR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we present a method for supplementing incomplete cases with information from other cases within a case base. The acquisition of complete and correct cases i...
171
click to vote
ACSC
2008
IEEE
16 years 1 months ago
2008
IEEE
1 In this paper we introduce a novel method of automating thesauri using syntactically constrained distributional similarity. With respect to syntactically conditioned cooccurrence...
192
click to vote
TIME
2007
IEEE
16 years 23 days ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
115
click to vote
CSL
2007
Springer
16 years 20 days ago
2007
Springer
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...