Mohammad Abdulaziz

CoRR, 2024

A Formal Analysis of Capacity Scaling Algorithms for Minimum Cost Flows.

[BibT_eX]

[DOI]

Thomas Ammer

Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

Interactive Theorem Provers: Applications in AI, Opportunities, and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

A Formal Analysis of RANKING.

[BibT_eX]

[DOI]

Christoph Madlener

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Formally Verified Solution Methods for Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Formally Verified SAT-Based AI Planning.

[BibT_eX]

[DOI]

Friedrich Kurz

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Formally Verified Solution Methods for Infinite-Horizon Markov Decision Processes.

[BibT_eX]

[DOI]

CoRR, 2022

Formal Semantics and Formally Verified Validation for Temporal Planning.

[BibT_eX]

[DOI]

Lukas Koller

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Cost Optimal Planning as Satisfiability.

[BibT_eX]

[DOI]

CoRR, 2021

Markov Decision Processes with Rewards.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2021

Verified Algorithms for Solving Markov Decision Processes.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2021

Computing Plan-Length Bounds Using Lengths of Longest Paths.

[BibT_eX]

[DOI]

Dominik Berger

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

AI Planning Languages Semantics.

[BibT_eX]

[DOI]

Peter Lammich

Arch. Formal Proofs, 2020

Verified SAT-Based AI Planning.

[BibT_eX]

[DOI]

Friedrich Kurz

Arch. Formal Proofs, 2020

2019

Trustworthy Graph Algorithms.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Tobias Nipkow

CoRR, 2019

Trustworthy Graph Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Kurt Mehlhorn

Tobias Nipkow

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Verified Compositional Algorithm for AI Planning.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

Plan-Length Bounds: Beyond 1-Way Dependency.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Formally Verified Algorithms for Upper-Bounding State Space Diameters.

[BibT_eX]

[DOI]

J. Autom. Reason., 2018

Upper Bounding Diameters of State Spaces of Factored Transition Systems.

[BibT_eX]

[DOI]

Friedrich Kurz

Arch. Formal Proofs, 2018

An Isabelle/HOL formalisation of Green's Theorem.

[BibT_eX]

[DOI]

Lawrence C. Paulson

Arch. Formal Proofs, 2018

A Formally Verified Validator for Classical Planning Problems and Solutions.

[BibT_eX]

[DOI]

Peter Lammich

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

2017

A State-Space Acyclicity Property for Exponentially Tighter Plan Length Bounds.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2015

Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

Exploiting Symmetries by Planning for a Descriptive Quotient.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Exploiting satisfiability modulo theories for analog layout automation.

[BibT_eX]

[DOI]

M. Watheq El-Kharashi