Existence and nonexistence of complete refinement operators
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
A Polynomial Approach to the Constructive Induction of Structural Knowledge
Machine Learning - Special issue on evaluating and changing representation
Machine Learning
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Constructing Refinement Operators by Decomposing Logical Implication
AI*IA '93 Proceedings of the Third Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Downward Refinement in the ALN Description Logic
HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems
An algorithm based on counterfactuals for concept learning in the semantic web
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Spaces of theories with ideal refinement operators
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Foundations of refinement operators for description logics
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Hybrid Learning of Ontology Classes
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
DL-FOIL Concept Learning in Description Logics
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Statistical Learning for Inductive Query Answering on OWL Ontologies
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Metric-based stochastic conceptual clustering for ontologies
Information Systems
Metric-based stochastic conceptual clustering for ontologies
Information Systems
Foundations of refinement operators for description logics
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Logic programming languages for databases and the web
A 25-year perspective on logic programming
Ideal downward refinement in the EL description logic
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
ORE - a tool for repairing and enriching knowledge bases
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part II
Class expression learning for ontology engineering
Web Semantics: Science, Services and Agents on the World Wide Web
Introduction to linked data and its lifecycle on the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Learning probabilistic description logics: a framework and algorithms
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Measuring similarity in description logics using refinement operators
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Universal OWL axiom enrichment for large knowledge bases
EKAW'12 Proceedings of the 18th international conference on Knowledge Engineering and Knowledge Management
Introduction to linked data and its lifecycle on the web
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically possible, thus providing an important step towards the definition of practically applicable operators.