Funder
Commonwealth Scientific and Industrial Research Organisation
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference57 articles.
1. Abboud, A., Williams, V.V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 377–391. SIAM (2016)
2. Abdulaziz, M., Gretton, C., Norrish, M.: Mechanising theoretical upper bounds in planning. In: Workshop on Knowledge Engineering for Planning and Scheduling (2014)
3. Abdulaziz, M., Gretton, C., Norrish, M.: Verified over-approximation of the diameter of propositionally factored transition systems. In: Interactive Theorem Proving, pp. 1–16. Springer, Berlin (2015)
4. Abdulaziz, M., Gretton, C., Norrish, M.: A state space acyclicity property for exponentially tighter plan length bounds. In: International Conference on Automated Planning and Scheduling (ICAPS). AAAI (2017)
5. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167–1181 (1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Completeness Thresholds for Memory Safety of Array Traversing Programs;Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis;2023-06-06
2. Property-directed reachability as abstract interpretation in the monotone theory;Proceedings of the ACM on Programming Languages;2022-01-12
3. A Formally Verified Validator for Classical Planning Problems and Solutions;2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI);2018-11