| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560375 |
| ISSN: | 1405-5546 |
| Autores: | Niitsuma, Hirotaka1 |
| Instituciones: | 1Okayama University, Graduate School of Natural Science and Technology, Okayama, Chugoku. Japón |
| Año: | 2018 |
| Periodo: | Oct-Dic |
| Volumen: | 22 |
| Número: | 4 |
| Paginación: | 1395-1402 |
| País: | México |
| Idioma: | Inglés |
| Resumen en inglés | Recursive miniKanren is logic programming language which can deal infinite recursive data structure and a subset of the Scheme language. We define a pattern match macro which can use the same syntax of the match macro of the Scheme language using recursive miniKanren. The macro enables to write searching sub-list with a given pattern by only few line code. Using this property, we introduce techniques writing context-free grammar with our match macro. Unlike other specific paraphrasing tools, our technique can combine logical relations of miniKanren with a context-free grammar. We show the logical relations resolves the ambiguity of a grammar. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Inteligencia artificial |
| Keyword: | Context-free grammars, Left recursion, Recursive miniKanren, Artificial intelligence |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
