10 Search Results for "Kern-Isberner, Gabriele"

Document
Invited Talk
DOI: 10.4230/LIPIcs.TIME.2025.1
Interpolation and Separation Problems for Linear Temporal Logics (Invited Talk)

Authors: Michael Zakharyaschev

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract
The talk gives a survey of recent results on two types of problems for linear temporal logics: one is related to the existence of a Craig interpolant for a given implication in a temporal logic, the other to the existence of a temporal query separating two given sets of temporal data instances.
Cite as

Michael Zakharyaschev. Interpolation and Separation Problems for Linear Temporal Logics (Invited Talk). In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{zakharyaschev:LIPIcs.TIME.2025.1,
  author =	{Zakharyaschev, Michael},
  title =	{{Interpolation and Separation Problems for Linear Temporal Logics}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{1:1--1:2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.1},
  URN =		{urn:nbn:de:0030-drops-244473},
  doi =		{10.4230/LIPIcs.TIME.2025.1},
  annote =	{Keywords: Linear temporal logic, Craig interpolation, query-by-example}
}
Document
DOI: 10.4230/LIPIcs.SAT.2025.8
Certifying Projected Knowledge Compilation

Authors: Randal E. Bryant, Yong Kiam Tan, and Marijn J. H. Heule

Published in: LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)

Abstract
Knowledge compilers convert Boolean formulas, given in conjunctive normal form (CNF), into representations that enable efficient evaluation of unweighted and weighted model counts, as well as a variety of other useful properties. With projected knowledge compilation, the generated representation describes the restriction of the formula to a designated set of data variables, with the remaining ones eliminated by existential quantification. Projected knowledge compilation has applications in a variety of domains, including formal verification and synthesis. This paper describes a formally verified proof framework for certifying the output of a projected knowledge compiler. It builds on an earlier clausal proof framework for certifying the output of a standard knowledge compiler. Extending the framework to projected compilation requires a method to represent Skolem assignments, describing how the quantified variables can be assigned, given an assignment for the data variables. We do so by extending the representation generated by the knowledge compiler to also encode Skolem assignments. We also refine the earlier framework, moving beyond purely clausal proofs to enable scaling certification to larger formulas. We present experimental results obtained by making small modifications to the D4 projected knowledge compiler and extensions of our earlier proof generator. We detail a soundness argument stating that a compiler output that passes our certifier is logically equivalent to the quantified input formula; the soundness argument has been formally validated using the HOL4 proof assistant. The checker also ensures that the compiler output satisfies the properties required for efficient unweighted and weighted model counting. We have developed two proof checkers for the certification framework: one written in C and designed for high performance and one written in CakeML and formally verified in HOL4.
Cite as

Randal E. Bryant, Yong Kiam Tan, and Marijn J. H. Heule. Certifying Projected Knowledge Compilation. In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 341, pp. 8:1-8:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{bryant_et_al:LIPIcs.SAT.2025.8,
  author =	{Bryant, Randal E. and Tan, Yong Kiam and Heule, Marijn J. H.},
  title =	{{Certifying Projected Knowledge Compilation}},
  booktitle =	{28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)},
  pages =	{8:1--8:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-381-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{341},
  editor =	{Berg, Jeremias and Nordstr\"{o}m, Jakob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.8},
  URN =		{urn:nbn:de:0030-drops-237422},
  doi =		{10.4230/LIPIcs.SAT.2025.8},
  annote =	{Keywords: Knowledge Compilation, Propositional model counting, Proof checking}
}
Document
DOI: 10.4230/LIPIcs.STACS.2025.20
On Cascades of Reset Automata

Authors: Roberto Borelli, Luca Geatti, Marco Montali, and Angelo Montanari

Published in: LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

Abstract
The Krohn-Rhodes decomposition theorem is a pivotal result in automata theory. It introduces the concept of cascade product, where two semiautomata, that is, automata devoid of initial and final states, are combined in a feed-forward fashion. The theorem states that any semiautomaton can be decomposed into a sequence of permutation-reset semiautomata. For the counter-free case, this decomposition consists entirely of reset components with two states each. This decomposition has significantly impacted recent research in various areas of computer science, including the identification of a class of transformer encoders equivalent to star-free languages and the conversion of Linear Temporal Logic formulas into past-only expressions (pastification). The paper revisits the cascade product in the context of reset automata, thus considering each component of the cascade as a language acceptor. First, we give regular expression counterparts of cascades of reset automata. We then establish several expressiveness results, identifying hierarchies of languages based on the restriction of the height (number of components) of the cascade or of the number of states in each level. We also show that any cascade of reset automata can be transformed, with a quadratic increase in height, into a cascade that only includes two-state components. Finally, we show that some fundamental operations on cascades, like intersection, union, negation, and concatenation with a symbol to the left, can be directly and efficiently computed by adding a two-state component.
Cite as

Roberto Borelli, Luca Geatti, Marco Montali, and Angelo Montanari. On Cascades of Reset Automata. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 20:1-20:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{borelli_et_al:LIPIcs.STACS.2025.20,
  author =	{Borelli, Roberto and Geatti, Luca and Montali, Marco and Montanari, Angelo},
  title =	{{On Cascades of Reset Automata}},
  booktitle =	{42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)},
  pages =	{20:1--20:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-365-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{327},
  editor =	{Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.20},
  URN =		{urn:nbn:de:0030-drops-228453},
  doi =		{10.4230/LIPIcs.STACS.2025.20},
  annote =	{Keywords: Automata, Cascade products, Regular expressions, Krohn-Rhodes theory}
}
Document
Position
DOI: 10.4230/TGDK.2.1.2
Grounding Stream Reasoning Research

Authors: Pieter Bonte, Jean-Paul Calbimonte, Daniel de Leng, Daniele Dell'Aglio, Emanuele Della Valle, Thomas Eiter, Federico Giannini, Fredrik Heintz, Konstantin Schekotihin, Danh Le-Phuoc, Alessandra Mileo, Patrik Schneider, Riccardo Tommasini, Jacopo Urbani, and Giacomo Ziffer

Published in: TGDK, Volume 2, Issue 1 (2024): Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge, Volume 2, Issue 1

Abstract
In the last decade, there has been a growing interest in applying AI technologies to implement complex data analytics over data streams. To this end, researchers in various fields have been organising a yearly event called the "Stream Reasoning Workshop" to share perspectives, challenges, and experiences around this topic. In this paper, the previous organisers of the workshops and other community members provide a summary of the main research results that have been discussed during the first six editions of the event. These results can be categorised into four main research areas: The first is concerned with the technological challenges related to handling large data streams. The second area aims at adapting and extending existing semantic technologies to data streams. The third and fourth areas focus on how to implement reasoning techniques, either considering deductive or inductive techniques, to extract new and valuable knowledge from the data in the stream. This summary is written not only to provide a crystallisation of the field, but also to point out distinctive traits of the stream reasoning community. Moreover, it also provides a foundation for future research by enumerating a list of use cases and open challenges, to stimulate others to join this exciting research area.
Cite as

Pieter Bonte, Jean-Paul Calbimonte, Daniel de Leng, Daniele Dell'Aglio, Emanuele Della Valle, Thomas Eiter, Federico Giannini, Fredrik Heintz, Konstantin Schekotihin, Danh Le-Phuoc, Alessandra Mileo, Patrik Schneider, Riccardo Tommasini, Jacopo Urbani, and Giacomo Ziffer. Grounding Stream Reasoning Research. In Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge (TGDK), Volume 2, Issue 1, pp. 2:1-2:47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{bonte_et_al:TGDK.2.1.2,
  author =	{Bonte, Pieter and Calbimonte, Jean-Paul and de Leng, Daniel and Dell'Aglio, Daniele and Della Valle, Emanuele and Eiter, Thomas and Giannini, Federico and Heintz, Fredrik and Schekotihin, Konstantin and Le-Phuoc, Danh and Mileo, Alessandra and Schneider, Patrik and Tommasini, Riccardo and Urbani, Jacopo and Ziffer, Giacomo},
  title =	{{Grounding Stream Reasoning Research}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{2:1--2:47},
  ISSN =	{2942-7517},
  year =	{2024},
  volume =	{2},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.2.1.2},
  URN =		{urn:nbn:de:0030-drops-198597},
  doi =		{10.4230/TGDK.2.1.2},
  annote =	{Keywords: Stream Reasoning, Stream Processing, RDF streams, Streaming Linked Data, Continuous query processing, Temporal Logics, High-performance computing, Databases}
}
Document
DOI: 10.4230/DagRep.9.2.73
The Role of Non-monotonic Reasoning in Future Development of Artificial Intelligence (Dagstuhl Perspectives Workshop 19072)

Authors: Anthony Hunter, Gabriele Kern-Isberner, Thomas Meyer, and Renata Wassermann

Published in: Dagstuhl Reports, Volume 9, Issue 2 (2019)

Abstract
This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 19072 "The Role of Non-monotonic Reasoning in Future Development of Artificial Intelligence". The workshop brought together researchers both from core topics and peripheral areas of non-monotonic reasoning (NMR), but also attracted researchers from other scientific domains in which recent developments have shown an increased relevance of NMR topics. The overall goal of this workshop was to reshape NMR as a core methodology for artificial intelligence being able to meet present and future challenges. Participants of this workshop discussed in what shape NMR would be useful for future AI, and how NMR can be developed for those requirements. The workshop started with brief survey talks and had some technical talks on central topics of NMR afterwards. These were followed by working groups on core aspects of NMR and potential links with learning. On the last day of the seminar, each working group presented their ideas and future plans. The workshop closed with a plenary discussion on the future of NMR.
Cite as

Anthony Hunter, Gabriele Kern-Isberner, Thomas Meyer, and Renata Wassermann. The Role of Non-monotonic Reasoning in Future Development of Artificial Intelligence (Dagstuhl Perspectives Workshop 19072). In Dagstuhl Reports, Volume 9, Issue 2, pp. 73-90, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{hunter_et_al:DagRep.9.2.73,
  author =	{Hunter, Anthony and Kern-Isberner, Gabriele and Meyer, Thomas and Wassermann, Renata},
  title =	{{The Role of Non-monotonic Reasoning in Future Development of Artificial Intelligence (Dagstuhl Perspectives Workshop 19072)}},
  pages =	{73--90},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{2},
  editor =	{Hunter, Anthony and Kern-Isberner, Gabriele and Meyer, Thomas and Wassermann, Renata},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.2.73},
  URN =		{urn:nbn:de:0030-drops-108601},
  doi =		{10.4230/DagRep.9.2.73},
  annote =	{Keywords: Artificial intelligence, Knowledge representation and reasoning, Nonmonotonic, default reasoning and belief revision, Probabilistic reasoning, Logic programming and answer set programming, Ontology engineering, Cognitive science, Machine learning}
}
Document
DOI: 10.4230/DagRep.9.1.47
Conditional Logics and Conditional Reasoning: New Joint Perspectives (Dagstuhl Seminar 19032)

Authors: Guillaume Aucher, Paul Egré, Gabriele Kern-Isberner, and Francesca Poggliesi

Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)

Abstract
In the last decades, with the emergence of artificial intelligence, a large number of logics called conditional logics have been introduced to model our conditional reasoning captured by so--called conditionals, which are statements of the form `if A then B'. More recently, conditional reasoning has also come under scrutiny by psychologists, yet with more pragmatic and empirical considerations. The main objective of this seminar was to provide an opportunity for these different communities working on that topic to meet and reinforce their ties. We focused on three specific issues. First, we investigated how people's intuitions about `counterpossibles' can be understood empirically and classified with respect to the theoretical accounts of conditional logics. Second, we reconsidered the various semantics of system P and we wondered to which extent pragmatics plays a role in the relevance relation between the antecedant and the consequent of a conditional. Third, we strove to apply the recent advances in proof theory and correspondence theory to conditional logics. These working groups were preceded by short talks and tutorials.
Cite as

Guillaume Aucher, Paul Egré, Gabriele Kern-Isberner, and Francesca Poggliesi. Conditional Logics and Conditional Reasoning: New Joint Perspectives (Dagstuhl Seminar 19032). In Dagstuhl Reports, Volume 9, Issue 1, pp. 47-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{aucher_et_al:DagRep.9.1.47,
  author =	{Aucher, Guillaume and Egr\'{e}, Paul and Kern-Isberner, Gabriele and Poggliesi, Francesca},
  title =	{{Conditional Logics and Conditional Reasoning: New Joint Perspectives (Dagstuhl Seminar 19032)}},
  pages =	{47--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{1},
  editor =	{Aucher, Guillaume and Egr\'{e}, Paul and Kern-Isberner, Gabriele and Poggliesi, Francesca},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.1.47},
  URN =		{urn:nbn:de:0030-drops-105693},
  doi =		{10.4230/DagRep.9.1.47},
  annote =	{Keywords: Commonsense reasoning, conditionals, correspondence theory, proof theory, psychology of reasoning}
}
Document
DOI: 10.4230/DagRep.5.5.92
Multi-disciplinary Approaches to Reasoning with Imperfect Information and Knowledge - a Synthesis and a Roadmap of Challenges (Dagstuhl Seminar 15221)

Authors: Igor Douven, Gabriele Kern-Isberner, Markus Knauff, and Henri Prade

Published in: Dagstuhl Reports, Volume 5, Issue 5 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15221 "Multi-disciplinary approaches to reasoning with imperfect information and knowledge - a synthesis and a roadmap of challenges". This multi-disciplinary seminar brought together researchers from computer science, philosophy and psychology dealing with topics of rational reasoning, reasoning with imperfect information and rational decision making in real world problems. The different views from computational, logical and cognitive perspectives provided new insights on overlapping goals and complemtary questions, for instance, when psychologists being interested in new formal models and computer scientists being interested whether their developed methods are materially adequate discussed logical and terminological backgrounds with philosophers. The combination of introductory talks, presentations and discussions of current work of the participants and discussion groups dealing with general questions lead to fruitful discussions where challenges for new paradigms of rational reasoning as well as visions and foci for interdisciplinary work were raised.
Cite as

Igor Douven, Gabriele Kern-Isberner, Markus Knauff, and Henri Prade. Multi-disciplinary Approaches to Reasoning with Imperfect Information and Knowledge - a Synthesis and a Roadmap of Challenges (Dagstuhl Seminar 15221). In Dagstuhl Reports, Volume 5, Issue 5, pp. 92-114, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{douven_et_al:DagRep.5.5.92,
  author =	{Douven, Igor and Kern-Isberner, Gabriele and Knauff, Markus and Prade, Henri},
  title =	{{Multi-disciplinary Approaches to Reasoning with Imperfect Information and Knowledge - a Synthesis and a Roadmap of Challenges (Dagstuhl Seminar 15221)}},
  pages =	{92--114},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{5},
  editor =	{Douven, Igor and Kern-Isberner, Gabriele and Knauff, Markus and Prade, Henri},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.5.92},
  URN =		{urn:nbn:de:0030-drops-54033},
  doi =		{10.4230/DagRep.5.5.92},
  annote =	{Keywords: uncertain reasoning; commonsense reasoning; rational reasoning; conditionals; nonmonotonic logics; belief revision; similarity-based reasoning: case-based, interpolative, extrapolative, and analogical reasoning; reasoning on time, space, and causality; abductive reasoning; semantical framework}
}
Document
DOI: 10.4230/DagSemProc.07351.4
A conceptual framework for (iterated) revision, update, and nonmonotonic reasoning

Authors: Gabriele Kern-Isberner

Published in: Dagstuhl Seminar Proceedings, Volume 7351, Formal Models of Belief Change in Rational Agents (2007)

Abstract
This paper makes a foundational contribution to the discussions on the very nature of belief change operations. Belief revision and belief update are investigated within an abstract framework of epistemic states and (qualitative or quantitative) conditionals. Moreover, we distinguish between background knowledge and contextual information in order to analyse belief change more appropriately. The rich epistemic representation framework allows us to make a clear conceptual distinction between revision and update on the one side, while revealing structural similarities on the other side. We propose generic postulates for revision and update that also apply to iterated change. Furthermore, we complete the unifying picture by introducing universal inference operations as a proper counterpart in nonmonotonic reasoning to iterated belief change.
Cite as

Gabriele Kern-Isberner. A conceptual framework for (iterated) revision, update, and nonmonotonic reasoning. In Formal Models of Belief Change in Rational Agents. Dagstuhl Seminar Proceedings, Volume 7351, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{kernisberner:DagSemProc.07351.4,
  author =	{Kern-Isberner, Gabriele},
  title =	{{A conceptual framework for (iterated) revision, update, and nonmonotonic reasoning}},
  booktitle =	{Formal Models of Belief Change in Rational Agents},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7351},
  editor =	{Giacomo Bonanno and James Delgrande and J\'{e}r\^{o}me Lang and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07351.4},
  URN =		{urn:nbn:de:0030-drops-12082},
  doi =		{10.4230/DagSemProc.07351.4},
  annote =	{Keywords: Belief revision, belief update, nonmonotonic inference, epistemic states, conditionals}
}
Document
DOI: 10.4230/DagSemProc.05321.13
Probabilistic Abduction Without Priors

Authors: Didier Dubois, Angelo Gilio, and Gabriele Kern-Isberner

Published in: Dagstuhl Seminar Proceedings, Volume 5321, Belief Change in Rational Agents: Perspectives from Artificial Intelligence, Philosophy, and Economics (2005)

Abstract
This paper considers the simple problem of abduction in the framework of Bayes theorem, i.e. computing a posterior probability of an hypothesis when its prior probability is not available, either because there are no statistical data on which to rely on, or simply because a human expert is reluctant to provide a subjective assessment of this prior probability. The problem remains an open issue since a simple sensitivity analysis on the value of the unknown prior yields empty results. This paper tries to survey and comment on various solutions to this problem: the use of likelihood functions (as in classical statistics), the use of information principles like maximal entropy, Shapley value, maximum likelihood. We also study the problem in the setting of de Finetti coherence approach, which does not exclude conditioning on contingent events with zero probability. We show that the ad hoc likelihood function method, that can be reinterpreted in terms of possibility theory, is consistent with most other formal approaches. However, the maximal entropy solution is significantly different.
Cite as

Didier Dubois, Angelo Gilio, and Gabriele Kern-Isberner. Probabilistic Abduction Without Priors. In Belief Change in Rational Agents: Perspectives from Artificial Intelligence, Philosophy, and Economics. Dagstuhl Seminar Proceedings, Volume 5321, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{dubois_et_al:DagSemProc.05321.13,
  author =	{Dubois, Didier and Gilio, Angelo and Kern-Isberner, Gabriele},
  title =	{{Probabilistic Abduction Without Priors}},
  booktitle =	{Belief Change in Rational Agents: Perspectives from Artificial Intelligence, Philosophy, and Economics},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5321},
  editor =	{James Delgrande and Jerome Lang and Hans Rott and Jean-Marc Tallon},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05321.13},
  URN =		{urn:nbn:de:0030-drops-3286},
  doi =		{10.4230/DagSemProc.05321.13},
  annote =	{Keywords: Conditional probability, Bayes Theorem, imprecise probability, entropy, possibility theory, maximum likelihood}
}
Document
DOI: 10.4230/DagSemProc.05171.4
Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV

Authors: Gabriele Kern-Isberner, Christoph Beierle, and Oliver Dusso

Published in: Dagstuhl Seminar Proceedings, Volume 5171, Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)

Abstract
Checking medical invoices, done by every health insurance company, is a labor-intensive task. Both speed and quality of executing this task may be increased by the knowledge-based decision support system ACMI which we present in this paper. As the relevant regulations also contain various default rules, ACMI`s knowledge core is modelled using the answer set programming paradigm. It turned out that all relevant rules could be expressed directly in this framework, providing for a declarative and easily extendable and modifiable knowledge base. ACMI is implemented using the DLV system.
Cite as

Gabriele Kern-Isberner, Christoph Beierle, and Oliver Dusso. Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{kernisberner_et_al:DagSemProc.05171.4,
  author =	{Kern-Isberner, Gabriele and Beierle, Christoph and Dusso, Oliver},
  title =	{{Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.4},
  URN =		{urn:nbn:de:0030-drops-2610},
  doi =		{10.4230/DagSemProc.05171.4},
  annote =	{Keywords: Answer sets, default rules, health insurance, rule schemas}
}
  • Refine by Type
  • 10 Document/PDF
  • 4 Document/HTML

  • Refine by Publication Year
  • 3 2025
  • 1 2024
  • 2 2019
  • 1 2016
  • 1 2007
  • Show More...

  • Refine by Author
  • 6 Kern-Isberner, Gabriele
  • 1 Aucher, Guillaume
  • 1 Beierle, Christoph
  • 1 Bonte, Pieter
  • 1 Borelli, Roberto
  • Show More...

  • Refine by Series/Journal
  • 3 LIPIcs
  • 1 TGDK
  • 3 DagRep
  • 3 DagSemProc

  • Refine by Classification
  • 1 Computing methodologies → Description logics
  • 1 Computing methodologies → Temporal reasoning
  • 1 Information systems → Data streams
  • 1 Information systems → Graph-based database models
  • 1 Information systems → Query languages for non-relational engines
  • Show More...

  • Refine by Keyword
  • 2 conditionals
  • 1 Answer sets
  • 1 Artificial intelligence
  • 1 Automata
  • 1 Bayes Theorem
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact