4 Search Results for "Drescher, Christian"

Document
Academic Track
DOI: 10.4230/OASIcs.SAIA.2024.3
EAM Diagrams - A Framework to Systematically Describe AI Systems for Effective AI Risk Assessment (Academic Track)

Authors: Ronald Schnitzer, Andreas Hapfelmeier, and Sonja Zillner

Published in: OASIcs, Volume 126, Symposium on Scaling AI Assessments (SAIA 2024)

Abstract
Artificial Intelligence (AI) is a transformative technology that offers new opportunities across various applications. However, the capabilities of AI systems introduce new risks, which require the adaptation of established risk assessment procedures. A prerequisite for any effective risk assessment is a systematic description of the system under consideration, including its inner workings and application environment. Existing system description methodologies are only partially applicable to complex AI systems, as they either address only parts of the AI system, such as datasets or models, or do not consider AI-specific characteristics at all. In this paper, we present a novel framework called EAM Diagrams for the systematic description of AI systems, gathering all relevant information along the AI life cycle required to support a comprehensive risk assessment. The framework introduces diagrams on three levels, covering the AI system’s environment, functional inner workings, and the learning process of integrated Machine Learning (ML) models.
Cite as

Ronald Schnitzer, Andreas Hapfelmeier, and Sonja Zillner. EAM Diagrams - A Framework to Systematically Describe AI Systems for Effective AI Risk Assessment (Academic Track). In Symposium on Scaling AI Assessments (SAIA 2024). Open Access Series in Informatics (OASIcs), Volume 126, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{schnitzer_et_al:OASIcs.SAIA.2024.3,
  author =	{Schnitzer, Ronald and Hapfelmeier, Andreas and Zillner, Sonja},
  title =	{{EAM Diagrams - A Framework to Systematically Describe AI Systems for Effective AI Risk Assessment}},
  booktitle =	{Symposium on Scaling AI Assessments (SAIA 2024)},
  pages =	{3:1--3:16},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-357-7},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{126},
  editor =	{G\"{o}rge, Rebekka and Haedecke, Elena and Poretschkin, Maximilian and Schmitz, Anna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SAIA.2024.3},
  URN =		{urn:nbn:de:0030-drops-227432},
  doi =		{10.4230/OASIcs.SAIA.2024.3},
  annote =	{Keywords: AI system description, AI risk assessment, AI auditability}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2012.188
Answer Set Solving with Lazy Nogood Generation

Authors: Christian Drescher and Toby Walsh

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

Abstract
Although Answer Set Programming (ASP) systems are highly optimised, their performance is sensitive to the size of the input and the inference it encodes. We address this deficiency by introducing a new extension to ASP solving. The idea is to integrate external propagators to represent parts of the encoding implicitly, rather than generating it a-priori. To match the state-of-the-art in conflict-driven solving, however, external propagators can make their inference explicit on demand. We demonstrate applicability in a novel Constraint Answer Set Programming system that can seamlessly integrate constraint propagation without sacrifficing the advantages of conflict-driven techniques. Experiments provide evidence for computational impact.
Cite as

Christian Drescher and Toby Walsh. Answer Set Solving with Lazy Nogood Generation. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 188-200, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{drescher_et_al:LIPIcs.ICLP.2012.188,
  author =	{Drescher, Christian and Walsh, Toby},
  title =	{{Answer Set Solving with Lazy Nogood Generation}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{188--200},
  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.188},
  URN =		{urn:nbn:de:0030-drops-36216},
  doi =		{10.4230/LIPIcs.ICLP.2012.188},
  annote =	{Keywords: Conflict-Driven Nogood Learning, Constraint Answer Set Programming, Constraint Propagation, Lazy Nogood Generation}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.28
Modelling Grammar Constraints with Answer Set Programming

Authors: Christian Drescher and Toby Walsh

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract
Representing and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-propagation of an ASP solver can achieve domain consistency on the original constraint. Experiments demonstrate computational impact.
Cite as

Christian Drescher and Toby Walsh. Modelling Grammar Constraints with Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 28-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{drescher_et_al:LIPIcs.ICLP.2011.28,
  author =	{Drescher, Christian and Walsh, Toby},
  title =	{{Modelling Grammar Constraints with Answer Set Programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{28--39},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.28},
  URN =		{urn:nbn:de:0030-drops-31723},
  doi =		{10.4230/LIPIcs.ICLP.2011.28},
  annote =	{Keywords: answer set programming, grammar-, regular-, precedence constraint}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2010.255
Constraint Answer Set Programming Systems

Authors: Christian Drescher

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)

Abstract
We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a very early stage, we motivate constraint answer set programming and report on related work, our research objectives, preliminary results we achieved, and future work.
Cite as

Christian Drescher. Constraint Answer Set Programming Systems. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 255-264, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{drescher:LIPIcs.ICLP.2010.255,
  author =	{Drescher, Christian},
  title =	{{Constraint Answer Set Programming Systems}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{255--264},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.255},
  URN =		{urn:nbn:de:0030-drops-26056},
  doi =		{10.4230/LIPIcs.ICLP.2010.255},
  annote =	{Keywords: Answer set programming, constraint logic programming, constraint processing}
}
  • Refine by Type
  • 4 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2025
  • 1 2012
  • 1 2011
  • 1 2010

  • Refine by Author
  • 3 Drescher, Christian
  • 2 Walsh, Toby
  • 1 Hapfelmeier, Andreas
  • 1 Schnitzer, Ronald
  • 1 Zillner, Sonja

  • Refine by Series/Journal
  • 3 LIPIcs
  • 1 OASIcs

  • Refine by Classification
  • 1 Software and its engineering → System description languages

  • Refine by Keyword
  • 1 AI auditability
  • 1 AI risk assessment
  • 1 AI system description
  • 1 Answer set programming
  • 1 Conflict-Driven Nogood Learning
  • 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