1450 search results - page 16 / 290 » Common knowledge revisited |
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
76
Voted
AUSAI
1999
Springer
15 years 1 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
116
click to vote
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. Such an analysis calls for the use of transfinite iterations of the correspond...