资源分类
》 资源 》论文》Generating Context-Free Grammars using Classical Planning

Generating Context-Free Grammars using Classical Planning

2019-10-29 | |  37 |   28 |   0
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

上一篇：Equilibria in Ordinal Games: A Framework based on Possibility Theory.

下一篇：Handling Non-local Dead-ends in Agent Planning Programs

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...