Add to ORKGThis short paper summarizes the work I have done over the last years on the use of higher-order Description Logics (DLs) for learning and mining in complex domains. In particular, the work proposes higher-order DLs as a means for metamodeling and metaquerying in Concept Learning and Knowledge Graph Mining, respectively
The quest for acquiring a formal representation of the knowledge of a domain of interest has attract...
Abstract. Many application domains make use of specific data structures such as sequences and graphs...
This paper analyses the graph mining problem, and the frequent pattern mining task associated with i...
This short paper summarizes the work I have done over the last years on the use of higher-order Desc...
We investigate an extension of Description Logics with higher-order capabilities, based on Henkin-st...
We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henk...
We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henk...
A key feature of inductive logic programming is its ability to learn first-order programs, which are...
This tutorial discusses some knowledge representation issues in machine learning. The focus is on ma...
In several application domains, the need arises of modeling and reasoning about meta-concepts and me...
Many problems, especially those with a composite structure, can nat- urally be expressed in higher o...
Abstract In this paper, we introduce our work on our doctorate with title "Higher Order Support...
This paper contains a systematic study of the foundations of knowledge representation, computation, ...
Learning in Description Logics (DLs) has been paid increasing attention over the last decade. Severa...
Predicate construction is a guided search process: a space of predicates must be enumerated in some ...
The quest for acquiring a formal representation of the knowledge of a domain of interest has attract...
Abstract. Many application domains make use of specific data structures such as sequences and graphs...
This paper analyses the graph mining problem, and the frequent pattern mining task associated with i...
This short paper summarizes the work I have done over the last years on the use of higher-order Desc...
We investigate an extension of Description Logics with higher-order capabilities, based on Henkin-st...
We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henk...
We investigate an extension of Description Logics (DL) with higher-order capabilities, based on Henk...
A key feature of inductive logic programming is its ability to learn first-order programs, which are...
This tutorial discusses some knowledge representation issues in machine learning. The focus is on ma...
In several application domains, the need arises of modeling and reasoning about meta-concepts and me...
Many problems, especially those with a composite structure, can nat- urally be expressed in higher o...
Abstract In this paper, we introduce our work on our doctorate with title "Higher Order Support...
This paper contains a systematic study of the foundations of knowledge representation, computation, ...
Learning in Description Logics (DLs) has been paid increasing attention over the last decade. Severa...
Predicate construction is a guided search process: a space of predicates must be enumerated in some ...
The quest for acquiring a formal representation of the knowledge of a domain of interest has attract...
Abstract. Many application domains make use of specific data structures such as sequences and graphs...
This paper analyses the graph mining problem, and the frequent pattern mining task associated with i...