Specifying and Verbalising Answer Set Programs in Controlled Natural Language
We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answe...
Saved in:
Published in | Theory and practice of logic programming Vol. 18; no. 3-4; pp. 691 - 705 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Cambridge, UK
Cambridge University Press
01.07.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!