• Home
  • KU Leuven
  • Department of Computer Science
  • Matthias van der Hallen
Matthias van der Hallen

Matthias van der Hallen
KU Leuven | ku leuven · Department of Computer Science

About

7
Publications
262
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
32
Citations

Publications

Publications (7)
Preprint
Full-text available
This paper focuses on quantifications whose nature, we believe, is generally undervalued within the Knowledge Representation community: they range over a set of concepts, i.e., of intensional objects identified in the ontology. Hence, we extend first order logic to allow referring to the intension of a symbol, i.e., to the concept it represents. Ou...
Article
Full-text available
This paper analyses the graph mining problem, and the frequent pattern mining task associated with it. In general, frequent pattern mining looks for a graph which occurs frequently within a network or, in the transactional setting, within a dataset of graphs. We discuss this task in the transactional setting, which is a problem of interest in many...
Conference Paper
Full-text available
Expressive KR languages are built by integrating different language constructs, or extending a language with new language constructs. This process is difficult if non-truth-functional or non-monotonic constructs are involved. What is needed is a compositional principle. This paper presents a compositional principle for defining logics by modular co...
Article
Full-text available
Many problems, especially those with a composite structure, can naturally be expressed in higher order logic. From a KR perspective modeling these problems in an intuitive way is a challenging task. In this paper we study the graph mining problem as an example of a higher order problem. In short, this problem asks us to find a graph that frequently...
Article
Full-text available
There is a growing need for abstractions in logic specification languages such as FO(.) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always described through a syntactical rewriting scheme, we present an alternative view on templates as second order defi...
Article
In this paper, we introduce our work on our doctorate with title "Higher Order Support in Logic Specification Languages for Data Mining Applications". Current logic specification languages, such as FO(·) provide an intuitive way for defining the knowledge within a problem domain. Extended support for data representation is lacking however, and we w...

Network

Cited By