The KB Paradigm and Its Application to Interactive Configuration

Pieter, Van Hertum; Dasseville, Ingmar; Janssens, Gerda; Denecker, Marc

doi:10.1007/978-3-319-28228-2_2

Cited by 3 publications

(3 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The specification language supported by IDP is an extension of first-order logic (FO) with types, inductive definitions, aggregates, arithmetic and partial functions, denoted FO(T,ID,Agg,Arit,PF) [20]. We only make use of the subset of FO(T,ID,Agg,Arit,PF) called FO(ID), which extends FO only with inductive definitions.…”

Section: B Fo(id) and Some Idp Inferencesmentioning

confidence: 99%

“…When a loop is detected, the query vertex causing the loop (by having the same label as a query vertex that is an ancestor of it) is labelled either with f or u, depending on whether the loop is over a negation (i.e. there is an f-labelled edge in the path connecting the two vertices with the same label) or not (lines [16][17][18][19][20]. u-labels can also propagate towards the root of the graph (line 28).…”

Section: Algorithm 2 Communication Procedures Initializationmentioning

confidence: 99%

See 1 more Smart Citation

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

Ambrossio,

Cramer

2019

Preprint

View full text Add to dashboard Cite

Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)) is a recently proposed non-monotonic logic for says-based access control. We define a query-driven decision procedure for dAEL(ID) that is implemented in the knowledgebase system IDP. The decision procedure is designed in such a way that it allows one to determine access rights while avoiding redundant information flow between principals in order to enhance security and reduce privacy concerns. Given that the decision procedure has in the worst case an exponential runtime, it is to be regarded as a proof of concept that increases our understanding of dAEL(ID), rather than being deployed for an access control system.

show abstract

Section: B Fo(id) and Some Idp Inferencesmentioning

confidence: 99%

Section: Algorithm 2 Communication Procedures Initializationmentioning

confidence: 99%

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

Ambrossio,

Cramer

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…It has been used to analyze security issues in several contexts, with an emphasis on formal approaches that allow intuitive modelling of the involved knowledge [Decroix et al 2013, Heyman 2013. The model expansion engine, and various other types of inference, have been used for interactive configuration [Van Hertum et al 2016, 2017.…”

Section: In Practicementioning

confidence: 99%

Predicate logic as a modeling language: the IDP system

Cat¹,

Bogaerts

Bruynooghe³

et al. 2018

Declarative Logic Programming: Theory, Systems, and Applications

Self Cite

View full text Add to dashboard Cite

With the technology of the time, Kowalski's seminal 1974 paper Predicate Logic as a Programming Language was a breakthrough for the use of logic in computer science. It introduced two fundamental ideas: on the declarative side, the use of the Horn clause logic fragment of classical logic, which was soon extended with negation as failure, on the procedural side the procedural interpretation which made it possible to write algorithms in the formalism.Since then, strong progress was made both on the declarative understanding of the logic programming formalism and in automated reasoning technologies, particularly in SAT solving, Constraint Programming and Answer Set Programming. This has paved the way for the development of an extension of logic programming that embodies a more pure view of logic as a modelling language and its role for problem solving.In this chapter, we present the IDP language and system. The language is essentially classical logic extended with one of logic programmings most important contributions to knowledge representation: the representation of complex definitions as rule sets under wellfounded semantics. The system is a knowledge base system: a system in which complex declarative information is stored in a knowledge base which can be used to solve different computational problems by applying multiple forms of inference. In this view, theories are declarative modellings, bags of information, i.e., descriptions of possible states of affairs. They are neither procedures nor descriptions of computational problems. As such, the IDP language and system preserve the fundamental idea of a declarative reading of logic programs, while they break with the fundamental idea of the procedural interpretation of logic programs.

show abstract

Product Configuration in Answer Set Programming

Mishra

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

This is a preliminary work on configuration knowledge representation which serves as a foundation for building interactive configuration systems in Answer Set Programming (ASP). The major concepts of the product configuration problem are identified and discussed with a bike configuration example. A fact format is developed for expressing product knowledge that is domainspecific and can be mapped from other systems. Finally, a domain-independent ASP encoding is provided that represents the concepts in the configuration problem.

show abstract

The KB Paradigm and Its Application to Interactive Configuration

Cited by 3 publications

References 32 publications

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

Predicate logic as a modeling language: the IDP system

Product Configuration in Answer Set Programming

Contact Info

Product

Resources

About