3758 search results - page 7 / 752 » A Complete Subsumption Algorithm |
89
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
DLOG
2004
14 years 11 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
DLOG
2010
14 years 7 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
AAAI
1990
14 years 10 months ago
1990
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...