Predicate logic as a modeling language: the IDP system

Cat, Broes De; Bogaerts, Bart; Bruynooghe, Maurice; Janssens, Gerda; Denecker, Marc

doi:10.1145/3191315.3191321

Cited by 38 publications

(33 citation statements)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the theory and algorithms presented in this paper, we implemented symmetry exploitation in the model expansion inference of the IDP system (De Cat et al 2016). IDP is a knowledge base system where knowledge about a problem can be modelled in FO(•), a rich extension of first-order logic (Denecker and Ternovska 2008).…”

Section: Methodsmentioning

confidence: 99%

On local domain symmetry for model expansion

Devriendt¹,

Bogaerts

Bruynooghe³

et al. 2016

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on local domain symmetry, which is induced by permutations of domain elements, and which can be detected on a first-order level. As such, our work is a continuation of the symmetry exploitation techniques of model generation systems, while it differs from more recent symmetry breaking techniques in answer set programming which detect symmetry on ground programs. Our main contributions are sufficient conditions for symmetry of model expansion problems, the identification of local domain interchangeability, which can often be broken completely, and efficient symmetry detection algorithms for both local domain interchangeability as well as local domain symmetry in general. Our approach is implemented in the model expansion system IDP, and we present experimental results showcasing the strong and weak points of our approach compared to SBASS, a symmetry breaking technique for answer set programming.Under consideration for acceptance in TPLP.

show abstract

Section: Methodsmentioning

confidence: 99%

On local domain symmetry for model expansion

Devriendt¹,

Bogaerts

Bruynooghe³

et al. 2016

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…IDP refers both to a first-order-based language and to the knowledge-based system in which it is used [3]. Knowledge-based systems are systems that adhere to the knowledge-based paradigm (KBP).…”

Section: Idp and The Knowledge-based Paradigmmentioning

confidence: 99%

Aligning, Interoperating, and Co-executing Air Traffic Control Rules Across PSOA RuleML and IDP

Deryck

Mitsikas

Almpani

et al. 2019

Rules and Reasoning

View full text Add to dashboard Cite

This paper studies Knowledge Bases (KBs) in PSOA RuleML and IDP, aligning, interoperating, and co-executing them for a use case of Air Traffic Control (ATC) regulations. We focus on the common core of facts and rules in both languages, explaining basic language features. The used knowledge sources are regulations that are specified in (legal) English, and an aircraft data schema. In the modeling process, inconsistencies in both sources were discovered. We present the discovery process utilizing both specification languages, and highlight their unique features. We introduce three extensions to this ATC KB core: 1) While the current PSOA RuleML does not distinguish the ontology separately from the instance level, IDP does. Hence we specify a vocabulary-enriched version of ATC KB in IDP for knowledge validation. 2) While the current IDP uses relational modeling, PSOA also supports graph modeling. Hence we specify a relationally interoperable graph version of ATC KB in PSOA.3) The KB is extended to include optimization criteria. With this, the determination of an optimal sequence of more than two aircraft is possible.

show abstract

“…The field of Knowledge Representation and Reasoning offers many different approaches and systems. In this paper, we have chosen to make use of the IDP system, a state-of-the-art implementation of the Knowledge Base Paradigm [7,18]. IDP allows domain knowledge to be expressed in the FO(.)…”

Section: Knowledge Representation and Reasoningmentioning

confidence: 99%

A Case-Based Inquiry into the Decision Model and Notation (DMN) and the Knowledge Base (KB) Paradigm

Deryck

Hasić

Vanthienen

et al. 2018

Rules and Reasoning

View full text Add to dashboard Cite

Modelling decisions in organisations is a challenging task. Deciding which modelling language to use for the problem at hand is a fundamental question. We investigate the Decision Model and Notation (DMN) standard and the IDP knowledge base system (KBS) in their effectiveness to model and solve specific real-life case problems. This paper presents two cases that are solved with DMN and IDP: (1) Income taxation for foreign artists temporarily working in Belgium; and (2) Registration duties when purchasing real-estate in Belgium. DMN is used as a front-end method, assisting the business analyst in the analysis and modelling of the business domain and communication with the domain expert. It is complemented with the representation of the logic in IDP as back-end system, which allows more forms of inference.

show abstract

Predicate logic as a modeling language: the IDP system

Cited by 38 publications

References 64 publications

On local domain symmetry for model expansion

On local domain symmetry for model expansion

Aligning, Interoperating, and Co-executing Air Traffic Control Rules Across PSOA RuleML and IDP

A Case-Based Inquiry into the Decision Model and Notation (DMN) and the Knowledge Base (KB) Paradigm

Contact Info

Product

Resources

About