Semantics of templates in a compositional framework for building logics

et al. 2019

Ann Math Artif Intell

Self Cite

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 occurs as a subgraph among a set of example graphs. We start from the problem's mathematical definition to solve it in three state-of-the-art specification systems. For IDP and ASP, which have no native support for higher order logic, we propose the use of encoding techniques such as the disjoint union technique and the saturation technique. ProB benefits from the higher order support for sets. We compare the performance of the three approaches to get an idea of the overhead of the higher order support. We propose higher-order language extensions for IDP-like specification languages and discuss what kind of solver support is needed. Native higher order shifts the burden of rewriting specifications using encoding techniques from the user to the solver itself.Matthias van der Hallen is supported by a Ph.D. fellowship from the Research Foundation -Flanders (FWO -Vlaanderen).

Section: A Faithful Encodingmentioning

confidence: 99%

Knowledge representation analysis of graph mining

Hallen

Paramonov

et al. 2019

Ann Math Artif Intell

Self Cite

“…Other future work may include language extensions to better support configuration-like tasks. A prime example of this are templates (Dasseville et al 2015).…”

Section: Challenges and Future Workmentioning

confidence: 99%

The KB paradigm and its application to interactive configuration

Hertum

Dasseville

Theory and Practice of Logic Programming

et al. 2016

Self Cite

The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of inference. As such, the paradigm applies a strict separation of concerns between information and problem solving. In this paper, we analyze the principles and feasibility of the knowledge base paradigm in the context of an important class of applications: interactive configuration problems. In interactive configuration problems, a configuration of interrelated objects under constraints is searched, where the system assists the user in reaching an intended configuration. It is widely recognized in industry that good software solutions for these problems are very difficult to develop. We investigate such problems from the perspective of the KB paradigm. We show that multiple functionalities in this domain can be achieved by applying different forms of logical inferences on a formal specification of the configuration domain. We report on a proof of concept of this approach in a real-life application with a banking company. To appear in Theory and Practice of Logic Programming (TPLP).Comment: To appear in Theory and Practice of Logic Programming (TPLP

“…A prime example of this are templates (Dasseville et al 2015). Oftentimes the theory of a configuration problem contains lots of constraints which are similar in structure.…”

Section: Challenges and Future Workmentioning

confidence: 99%

The KB Paradigm and Its Application to Interactive Configuration

Pieter

Dasseville

Practical Aspects of Declarative Languages

et al. 2016

Self Cite

The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of inference. As such, the paradigm applies a strict separation of concerns between information and problem solving.In this paper, we analyze the principles and feasibility of the knowledge base paradigm in the context of an important class of applications: interactive configuration problems. In interactive configuration problems, a configuration of interrelated objects under constraints is searched, where the system assists the user in reaching an intended configuration. It is widely recognized in industry that good software solutions for these problems are very difficult to develop. We investigate such problems from the perspective of the KB paradigm. We show that multiple functionalities in this domain can be achieved by applying different forms of logical inferences on a formal specification of the configuration domain. We report on a proof of concept of this approach in a real-life application with a banking company.