Generating Context-Free Grammars Using Classical Planning
Abstract
This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementing the two canonical tasks for CFGs, string production and string recognition.
Cite
Text
Segovia-Aguas et al. "Generating Context-Free Grammars Using Classical Planning." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/613Markdown
[Segovia-Aguas et al. "Generating Context-Free Grammars Using Classical Planning." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/segoviaaguas2017ijcai-generating/) doi:10.24963/IJCAI.2017/613BibTeX
@inproceedings{segoviaaguas2017ijcai-generating,
title = {{Generating Context-Free Grammars Using Classical Planning}},
author = {Segovia-Aguas, Javier and Celorrio, Sergio Jiménez and Jonsson, Anders},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
pages = {4391-4397},
doi = {10.24963/IJCAI.2017/613},
url = {https://mlanthology.org/ijcai/2017/segoviaaguas2017ijcai-generating/}
}