Specifying and verbalising answer set programs in controlled natural language

DOI10.1017/S1471068418000327MaRDI QIDQ4559823zbMATH OpenOpenAlexFDO

Authors Rolf Schwitter

Publication date 4 December 2018

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.10765

zbMATH Keywords

answer set programmingbi-directional grammarscontrolled natural languagesexecutable specificationssentence planning

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30) Natural language processing (68T50)

Abstract: 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 answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing. This paper is under consideration for acceptance in TPLP.

Recommendations

• A principled approach to grammars for controlled natural languages and predictive editors
• Modelling grammar constraints with answer set programming
• On structural analysis of non-ground answer-set programs
• Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
• Program completion in the input language of GRINGO

Cites work

• Generating explanations for biomedical queries
• scientific article; zbMATH DE number 43016 (Why is no real title available?)
• scientific article; zbMATH DE number 788036 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming

Cited in

(6)

• A principled approach to grammars for controlled natural languages and predictive editors
• Uhura: an authoring tool for specifying answer-set programs using controlled natural language
• Representing the language of the causal calculator in answer set programming
• On structural analysis of non-ground answer-set programs
• Synthesizing Imperative Code from Answer Set Programming Specifications
• Contrastive explanations for answer-set programs

Describes a project that uses

Uses Software

• PENGASP

This page was built for publication: Specifying and verbalising answer set programs in controlled natural language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559823)