4066 search results - page 35 / 814 » Almost Complete Sets |
DLOG
2011
13 years 1 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
BILDMED
2007
13 years 11 months ago
2007
This work aims to propose an interactive method for a iconic and textual annotation of digital mammograms. The suggested annotation tool consists of a semantic network to represent...
LREC
2008
13 years 11 months ago
2008
This paper presents the complete and consistent ontological annotation of the nominal part of WordNet. The annotation has been carried out using the semantic features defined in t...
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
KBS
2002
13 years 9 months ago
2002
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead o...