Specifying and Verbalising Answer Set Programs in Controlled Natural Language

DOI10.1017/S1471068418000327zbMath1451.68295arXiv1804.10765OpenAlexW2964259791MaRDI QIDQ4559823

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 programmingexecutable specificationscontrolled natural languagesbi-directional grammarssentence planning

Mathematics Subject Classification ID

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

Uses Software

• PENGASP

Cites Work

• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Generating explanations for biomedical queries
• Unnamed Item
• Unnamed Item

This page was built for publication: Specifying and Verbalising Answer Set Programs in Controlled Natural Language