default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Abdulaziz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Mohammad Abdulaziz
:
Interactive Theorem Provers: Applications in AI, Opportunities, and Challenges. AAAI 2024: 22660- [c16]Mohammad Abdulaziz, Thomas Ammer:
A Formal Analysis of Capacity Scaling Algorithms for Minimum Cost Flows. ITP 2024: 3:1-3:19 - [i8]Maximilian Schäffeler, Mohammad Abdulaziz:
Formally Verified Approximate Policy Iteration. CoRR abs/2406.07340 (2024) - 2023
- [c15]Mohammad Abdulaziz, Friedrich Kurz:
Formally Verified SAT-Based AI Planning. AAAI 2023: 14665-14673 - [c14]Maximilian Schäffeler, Mohammad Abdulaziz:
Formally Verified Solution Methods for Markov Decision Processes. AAAI 2023: 15073-15081 - [c13]Mohammad Abdulaziz, Christoph Madlener:
A Formal Analysis of RANKING. ITP 2023: 3:1-3:18 - [i7]Mohammad Abdulaziz, Christoph Madlener:
A Formal Analysis of RANKING. CoRR abs/2302.13747 (2023) - 2022
- [c12]Mohammad Abdulaziz, Lukas Koller:
Formal Semantics and Formally Verified Validation for Temporal Planning. AAAI 2022: 9635-9643 - [i6]Mohammad Abdulaziz, Lukas Koller:
Formal Semantics and Formally Verified Validation for Temporal Planning. CoRR abs/2203.13604 (2022) - [i5]Maximilian Schäffeler, Mohammad Abdulaziz:
Formally Verified Solution Methods for Infinite-Horizon Markov Decision Processes. CoRR abs/2206.02169 (2022) - 2021
- [j8]Maximilian Schäffeler, Mohammad Abdulaziz:
Verified Algorithms for Solving Markov Decision Processes. Arch. Formal Proofs 2021 (2021) - [j7]Maximilian Schäffeler, Mohammad Abdulaziz:
Markov Decision Processes with Rewards. Arch. Formal Proofs 2021 (2021) - [c11]Mohammad Abdulaziz, Dominik Berger:
Computing Plan-Length Bounds Using Lengths of Longest Paths. AAAI 2021: 11709-11717 - [i4]Mohammad Abdulaziz:
Cost Optimal Planning as Satisfiability. CoRR abs/2103.02355 (2021) - 2020
- [j6]Mohammad Abdulaziz, Friedrich Kurz:
Verified SAT-Based AI Planning. Arch. Formal Proofs 2020 (2020) - [j5]Mohammad Abdulaziz, Peter Lammich:
AI Planning Languages Semantics. Arch. Formal Proofs 2020 (2020) - [c10]Mohammad Abdulaziz, Dominik Berger:
Computing Plan-Length Bounds Using Lengths of Longest Paths. SOCS 2020: 117-118 - [i3]Mohammad Abdulaziz, Dominik Berger:
Computing Plan-Length Bounds Using Lengths of Longest Paths. CoRR abs/2006.01011 (2020) - [i2]Mohammad Abdulaziz, Friedrich Kurz:
Formally Verified SAT-Based AI Planning. CoRR abs/2010.14648 (2020)
2010 – 2019
- 2019
- [j4]Mohammad Abdulaziz, Lawrence C. Paulson:
An Isabelle/HOL Formalisation of Green's Theorem. J. Autom. Reason. 63(3): 763-786 (2019) - [c9]Mohammad Abdulaziz:
Plan-Length Bounds: Beyond 1-Way Dependency. AAAI 2019: 7502-7510 - [c8]Mohammad Abdulaziz, Charles Gretton, Michael Norrish:
A Verified Compositional Algorithm for AI Planning. ITP 2019: 4:1-4:19 - [c7]Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow:
Trustworthy Graph Algorithms (Invited Talk). MFCS 2019: 1:1-1:22 - [i1]Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow:
Trustworthy Graph Algorithms. CoRR abs/1907.04065 (2019) - 2018
- [j3]Mohammad Abdulaziz, Lawrence C. Paulson:
An Isabelle/HOL formalisation of Green's Theorem. Arch. Formal Proofs 2018 (2018) - [j2]Friedrich Kurz, Mohammad Abdulaziz:
Upper Bounding Diameters of State Spaces of Factored Transition Systems. Arch. Formal Proofs 2018 (2018) - [j1]Mohammad Abdulaziz, Michael Norrish, Charles Gretton:
Formally Verified Algorithms for Upper-Bounding State Space Diameters. J. Autom. Reason. 61(1-4): 485-520 (2018) - [c6]Mohammad Abdulaziz, Peter Lammich:
A Formally Verified Validator for Classical Planning Problems and Solutions. ICTAI 2018: 474-479 - 2017
- [c5]Mohammad Abdulaziz, Charles Gretton, Michael Norrish:
A State-Space Acyclicity Property for Exponentially Tighter Plan Length Bounds. ICAPS 2017: 2-10 - 2016
- [c4]Mohammad Abdulaziz, Lawrence C. Paulson:
An Isabelle/HOL Formalisation of Green's Theorem. ITP 2016: 3-19 - 2015
- [c3]Mohammad Abdulaziz, Michael Norrish, Charles Gretton:
Exploiting Symmetries by Planning for a Descriptive Quotient. IJCAI 2015: 1479-1486 - [c2]Mohammad Abdulaziz, Charles Gretton, Michael Norrish:
Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems. ITP 2015: 1-16 - 2014
- [c1]Sherif M. Saif, Mohamed Dessouky, Salwa M. Nassar, Hazem M. Abbas, M. Watheq El-Kharashi, Mohammad Abdulaziz:
Exploiting satisfiability modulo theories for analog layout automation. IDT 2014: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
