11 research outputs found
Exploiting Game Theory for Analysing Justifications
Justification theory is a unifying semantic framework. While it has its roots
in non-monotonic logics, it can be applied to various areas in computer
science, especially in explainable reasoning; its most central concept is a
justification: an explanation why a property holds (or does not hold) in a
model. In this paper, we continue the study of justification theory by means of
three major contributions. The first is studying the relation between
justification theory and game theory. We show that justification frameworks can
be seen as a special type of games. The established connection provides the
theoretical foundations for our next two contributions. The second contribution
is studying under which condition two different dialects of justification
theory (graphs as explanations vs trees as explanations) coincide. The third
contribution is establishing a precise criterion of when a semantics induced by
justification theory yields consistent results. In the past proving that such
semantics were consistent took cumbersome and elaborate proofs. We show that
these criteria are indeed satisfied for all common semantics of logic
programming. This paper is under consideration for acceptance in Theory and
Practice of Logic Programming (TPLP).Comment: Paper presented at the 36th International Conference on Logic
Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September
2020, 15+8 page
On Nested Justification Systems
Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al., allow for the composition of justification systems. This notion of nesting thus enables the modular definition of semantics of rule-based languages, and increases the representational capacities of justification theory. As we show in this paper, the original characterization of semantics for nested justification systems leads to the loss of information relevant for explanations. In view of this problem, we provide an alternative characterization of their semantics and show that it is equivalent to the original one. Furthermore, we show how nested justification systems allow representing fixpoint definitions
Legislation in the knowledge base paradigm: interactive decision enactment for registration duties
© 2019 IEEE. Recently, a prototype for an interactive decision enactment system for notaries was developed. This prototype follows the Knowledge Base Paradigm (KBP): it consists of purely declarative domain knowledge, to which various logical inference methods can be applied. This paper extends that work in two ways. First, we experimentally validate the claim that the KBP leads to highly maintainable software. Second, we extend the number of additional logical inferences, which allows us to address a number of usability concerns. This provides further evidence for the claim that the KBP is indeed a viable method of developing interactive software systems. The resulting interactive decision enactment prototype is a fully generic system, that can be applied to other domains with minimal effort.status: publishe
Influence of lactation upon adenylate cyclase activity in pancreatic islets
info:eu-repo/semantics/publishedComm. 20th Annual Meeting of the European Association for the Study of Diabetes - London, 13.9.198
De impact van brachycephalie op het welzijn bij de kat /
Master of Veterinary Medicine in de diergeneeskunde: gezelschapsdiere
Iterated exaptation
This volume focuses on detailed studies of various aspects of Construction Morphology, and combines theoretical analysis and descriptive detail.status: publishe