Search Results

Documents authored by Vennekens, Joost

Document
DOI: 10.4230/DagRep.14.3.75
Trustworthiness and Responsibility in AI - Causality, Learning, and Verification (Dagstuhl Seminar 24121)

Authors: Vaishak Belle, Hana Chockler, Shannon Vallor, Kush R. Varshney, Joost Vennekens, and Sander Beckers

Published in: Dagstuhl Reports, Volume 14, Issue 3 (2024)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 24121 "Trustworthiness and Responsibility in AI - Causality, Learning, and Verification". How can we trust autonomous computer-based systems? Since such systems are increasingly being deployed in safety-critical environments while interoperating with humans, this question is rapidly becoming more important. This Dagstuhl Seminar addressed this question by bringing together an interdisciplinary group of researchers from Artificial Intelligence (AI), Machine Learning (ML), Robotics (ROB), hardware and software verification (VER), Software Engineering (SE), and Social Sciences (SS); who provided different and complementary perspectives on responsibility and correctness regarding the design of algorithms, interfaces, and development methodologies in AI. The purpose of the seminar was to initiate a debate around both theoretical foundations and practical methodologies for a "Trustworthiness & Responsibility in AI" framework that integrates quantifiable responsibility and verifiable correctness into all stages of the software engineering process. Such a framework will allow governance and regulatory practices to be viewed not only as rules and regulations imposed from afar, but instead as an integrative process of dialogue and discovery to understand why an autonomous system might fail and how to help designers and regulators address these through proactive governance. In particular, we considered how to reason about responsibility, blame, and causal factors affecting the trustworthiness of the system. More practically, we asked what tools we can provide to regulators, verification and validation professionals, and system designers to help them clarify the intent and content of regulations down to a machine interpretable form. While existing regulations are necessarily vague, and dependent on human interpretation, we asked: How should they now be made precise and quantifiable? What is lost in the process of quantification? How do we address factors that are qualitative in nature, and integrate such concerns in an engineering regime? In addressing these questions, the seminar benefitted from extensive discussions between AI, ML, ROB, VER, SE, and SS researchers who have experience with ethical, societal, and legal aspects of AI, complex AI systems, software engineering for AI systems, and causal analysis of counterexamples and software faults.
Cite as

Vaishak Belle, Hana Chockler, Shannon Vallor, Kush R. Varshney, Joost Vennekens, and Sander Beckers. Trustworthiness and Responsibility in AI - Causality, Learning, and Verification (Dagstuhl Seminar 24121). In Dagstuhl Reports, Volume 14, Issue 3, pp. 75-91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{belle_et_al:DagRep.14.3.75,
  author =	{Belle, Vaishak and Chockler, Hana and Vallor, Shannon and Varshney, Kush R. and Vennekens, Joost and Beckers, Sander},
  title =	{{Trustworthiness and Responsibility in AI - Causality, Learning, and Verification (Dagstuhl Seminar 24121)}},
  pages =	{75--91},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{14},
  number =	{3},
  editor =	{Belle, Vaishak and Chockler, Hana and Vallor, Shannon and Varshney, Kush R. and Vennekens, Joost and Beckers, Sander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.3.75},
  URN =		{urn:nbn:de:0030-drops-211848},
  doi =		{10.4230/DagRep.14.3.75},
  annote =	{Keywords: responsible AI, trustworthy AI, causal machine learning, autonomous systems}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.13
Application of Logic-Based Methods to Machine Component Design

Authors: Bram Aerts and Joost Vennekens

Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

Abstract
This paper describes an application worked out in collaboration with a company that produces made-to-order machine components. The goal of the project is to develop a system that can support the company's engineers by automating parts of their component design process. We propose a knowledge extraction methodology based on the recent DMN (Decision Model and Notation) standard and compare a rule-based and a constraint-based method for representing the resulting knowledge. We study the advantages and disadvantages of both approaches in the context of the company's real-life application.
Cite as

Bram Aerts and Joost Vennekens. Application of Logic-Based Methods to Machine Component Design. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{aerts_et_al:OASIcs.ICLP.2018.13,
  author =	{Aerts, Bram and Vennekens, Joost},
  title =	{{Application of Logic-Based Methods to Machine Component Design}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{13:1--13:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.13},
  URN =		{urn:nbn:de:0030-drops-98798},
  doi =		{10.4230/OASIcs.ICLP.2018.13},
  annote =	{Keywords: Application, Expert Systems, Constraint Solving, Rule-based Systems, Decision Modelling, DMN, Product Configuration}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2012.277
A Tarskian Informal Semantics for Answer Set Programming

Authors: Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)

Abstract
In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, however, we find numerous applications in which rational agents no longer seem to play any role. Therefore, we propose here an alternative explanation of the intuitive meaning of ASP programs, in which they are not viewed as statements about an agent's beliefs, but as objective statements about the world. We argue that this view is more natural for a large part of current ASP practice, in particular the so-called Generate-Define-Test programs.
Cite as

Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens. A Tarskian Informal Semantics for Answer Set Programming. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 277-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{denecker_et_al:LIPIcs.ICLP.2012.277,
  author =	{Denecker, Marc and Lierler, Yuliya and Truszczynski, Miroslaw and Vennekens, Joost},
  title =	{{A Tarskian Informal Semantics for Answer Set Programming}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{277--289},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.277},
  URN =		{urn:nbn:de:0030-drops-36295},
  doi =		{10.4230/LIPIcs.ICLP.2012.277},
  annote =	{Keywords: Answer set programming, informal semantics, generate-define-test}
}
Document
DOI: 10.4230/DagSemProc.05171.1
05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints

Authors: Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens

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

Abstract
From 24.04.05 to 29.04.05, the Dagstuhl Seminar 05171 ``Nonmonotonic Reasoning, Answer Set Programming and Constraints'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens. 05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{brewka_et_al:DagSemProc.05171.1,
  author =	{Brewka, Gerhard and Niemel\"{a}, Ilkka and Schaub, Torsten and Truszczynski, Miroslaw and Vennekens, Joost},
  title =	{{05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--23},
  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.1},
  URN =		{urn:nbn:de:0030-drops-2690},
  doi =		{10.4230/DagSemProc.05171.1},
  annote =	{Keywords: Knowledge representation, nonmonotonic reasoning, logic programming, answer-set programming, constraints}
}
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact