3758 search results - page 1 / 752 » A Complete Subsumption Algorithm |
AIIA
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
DLOG
2011
12 years 8 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...
AAAI
2007
13 years 6 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
KR
1998
Springer
13 years 8 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
ILP
2000
Springer
13 years 8 months ago
2000
Springer
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...