Bridging LTLf Inference to GNN Inference for Learning LTLf Formulae
Keywords:Planning, Routing, And Scheduling (PRS), Machine Learning (ML)
AbstractLearning linear temporal logic on finite traces (LTLf) formulae aims to learn a target formula that characterizes the high-level behavior of a system from observation traces in planning. Existing approaches to learning LTLf formulae, however, can hardly learn accurate LTLf formulae from noisy data. It is challenging to design an efficient search mechanism in the large search space in form of arbitrary LTLf formulae while alleviating the wrong search bias resulting from noisy data. In this paper, we tackle this problem by bridging LTLf inference to GNN inference. Our key theoretical contribution is showing that GNN inference can simulate LTLf inference to distinguish traces. Based on our theoretical result, we design a GNN-based approach, GLTLf, which combines GNN inference and parameter interpretation to seek the target formula in the large search space. Thanks to the non-deterministic learning process of GNNs, GLTLf is able to cope with noise. We evaluate GLTLf on various datasets with noise. Our experimental results confirm the effectiveness of GNN inference in learning LTLf formulae and show that GLTLf is superior to the state-of-the-art approaches.
How to Cite
Luo, W., Liang, P., Du, J., Wan, H., Peng, B., & Zhang, D. (2022). Bridging LTLf Inference to GNN Inference for Learning LTLf Formulae. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9), 9849-9857. https://doi.org/10.1609/aaai.v36i9.21221
AAAI Technical Track on Planning, Routing, and Scheduling