Decompositions in Compositional Translation of LTLf to DFA (Student Abstract)

Authors

  • Yash Kankariya Georgia Institute of Technology
  • Suguman Bansal Georgia Institute of Technology

DOI:

https://doi.org/10.1609/aaai.v38i21.30462

Keywords:

Automated Reasoning, Logic, Planning

Abstract

Prior compositional methods in LTLf to DFA conversion have focussed on improving the composition phase. In this work, we examine improvements to the decomposition phase that result in overall improvements in LTLf to DFA translation. Our work is based on reducing the structure of the underlying Abstract Syntax Tree (AST) of a formula such that the new AST results in fewer composition operations.

Downloads

Published

2024-03-24

How to Cite

Kankariya, Y., & Bansal, S. (2024). Decompositions in Compositional Translation of LTLf to DFA (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 38(21), 23537-23538. https://doi.org/10.1609/aaai.v38i21.30462