Monika Seisenberger

Orcid: 0000-0002-2226-386X

Affiliations:
  • Swansea University, UK


According to our database1, Monika Seisenberger authored at least 29 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QUCE: The Minimisation and Quantification of Path-Based Uncertainty for Generative Counterfactual Explanations.
CoRR, 2024

2023
Concurrent Gaussian elimination.
CoRR, 2023

A Tool-Chain for the Verification of Geographic Scheme Data.
Proceedings of the Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification, 2023

A Formal Introduction to Batch-Integrated Gradients for Temporal Explanations.
Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

Counterfactual-Integrated Gradients: Counterfactual Feature Attribution for Medical Records.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

Batch Integrated Gradients: Explanations for Temporal Electronic Health Records.
Proceedings of the Artificial Intelligence in Medicine, 2023

2022
Report on BCTCS 2022.
Bull. EATCS, 2022

On Understanding the Influence of Controllable Factors with a Feature Attribution Algorithm: a Medical Case Study.
CoRR, 2022

Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Practice, 2022

Towards Polynomial Adaptive Local Explanations for Healthcare Classifiers.
Proceedings of the Foundations of Intelligent Systems - 26th International Symposium, 2022

On Understanding the Influence of Controllable Factors with a Feature Attribution Algorithm: a Medical Case Study.
Proceedings of the International Conference on INnovations in Intelligent SysTems and Applications, 2022

2021
Towards a Shapley Value Graph Framework for Medical peer-influence.
CoRR, 2021

Adaptive Neighbourhoods for the Discovery of Adversarial Examples.
CoRR, 2021

2019
Program extraction applied to monadic parsing.
J. Log. Comput., 2019

2018
Verification of the European Rail Traffic Management System in Real-Time Maude.
Sci. Comput. Program., 2018

A Chatbot Framework for the Children's Legal Centre.
Proceedings of the Legal Knowledge and Information Systems, 2018

2017
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.
Math. Struct. Comput. Sci., 2017

2016
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).
Dagstuhl Reports, 2016

2015
Extracting verified decision procedures: DPLL and Resolution.
Log. Methods Comput. Sci., 2015

Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude.
Proceedings of the Formal Techniques for Safety-Critical Systems, 2015

2013
Extracting Imperative Programs from Proofs: In-place Quicksort.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

Verification of Solid State Interlocking Programs.
Proceedings of the Software Engineering and Formal Methods, 2013

2012
Proofs, Programs, Processes.
Theory Comput. Syst., 2012

Extracting a DPLL Algorithm.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

2011
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2008
Programs from proofs using classical dependent choice.
Ann. Pure Appl. Log., 2008

2005
Applications of inductive definitions and choice principles to program synthesis.
Proceedings of the From sets and types to topology and analysis, 2005

2001
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction.
J. Autom. Reason., 2001

2000
An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000


  Loading...