Mohammad Abdulaziz
Mohammad Abdulaziz
Techniche Universität München
Verified email at in.tum.de - Homepage
Title
Cited by
Cited by
Year
A state-space acyclicity property for exponentially tighter plan length bounds
M Abdulaziz, C Gretton, M Norrish
Proceedings of the International Conference on Automated Planning and …, 2017
132017
An Isabelle/HOL formalisation of Green’s theorem
M Abdulaziz, LC Paulson
Journal of Automated Reasoning 63 (3), 763-786, 2019
92019
A machine learning technique for hardness estimation of QFBV SMT problems
MA Aziz, A Wassal, N Darwish
EPiC Series in Computing 20, 57-66, 2013
9*2013
Verified over-approximation of the diameter of propositionally factored transition systems
M Abdulaziz, C Gretton, M Norrish
International Conference on Interactive Theorem Proving, 1-16, 2015
82015
Trustworthy Graph Algorithms
M Abdulaziz, K Mehlhorn, T Nipkow
arXiv preprint arXiv:1907.04065, 2019
7*2019
Formally verified algorithms for upper-bounding state space diameters
M Abdulaziz, M Norrish, C Gretton
Journal of Automated Reasoning 61 (1), 485-520, 2018
72018
Plan-length bounds: Beyond 1-way dependency
M Abdulaziz
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7502-7510, 2019
52019
A formally verified validator for classical planning problems and solutions
M Abdulaziz, P Lammich
2018 IEEE 30th International Conference on Tools with Artificial …, 2018
52018
Exploiting symmetries by planning for a descriptive quotient
M Abdulaziz, C Gretton, M Norrish
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
52015
Mechanising theoretical upper bounds in planning
M Abdulaziz, C Gretton, M Norrish
Workshop on Knowledge Engineering for Planning and Scheduling, 2014
32014
A verified compositional algorithm for ai planning
M Abdulaziz, C Gretton, M Norrish
10th International Conference on Interactive Theorem Proving (ITP 2019), 2019
22019
Formally Verified Compositional Algorithms for Factored Transition Systems
M Abdulaziz
The Australian National University, 2017
22017
Computing Plan-Length Bounds Using Lengths of Longest Paths
M Abdulaziz, D Berger
Thirteenth Annual Symposium on Combinatorial Search, 2020
12020
Exploiting satisfiability modulo theories for analog layout automation
SM Saif, M Dessouky, S Nassar, H Abbas, MW El-Kharashi, M Abdulaziz
2014 9th International Design and Test Symposium (IDT), 1-6, 2014
12014
Cost Optimal Planning as Satisfiability
M Abdulaziz
arXiv preprint arXiv:2103.02355, 2021
2021
Formally Verified SAT-Based AI Planning
M Abdulaziz, F Kurz
arXiv preprint arXiv:2010.14648, 2020
2020
AI Planning Languages Semantics.
M Abdulaziz, P Lammich
Arch. Formal Proofs 2020, 2020
2020
Verified SAT-Based AI Planning
M Abdulaziz, F Kurz
Arch. Formal Proofs 2020, 2020
2020
Compositional Upper-Bounding of Diameters of Factored Digraphs
M ABDULAZIZ, C GRETTON, M NORRISH
2019
Upper Bounding Diameters of State Spaces of Factored Transition Systems
F Kurz, M Abdulaziz
Arch. Formal Proofs 2018, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20