Controlled natural language processing as answer set programming

An experiment

Rolf Schwitter*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution


Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts are then processed by an ASP meta-interpreter that allows us to infer new knowledge.

Original languageEnglish
Title of host publicationControlled Natural Language - 4th International Workshop, CNL 2014, Proceedings
EditorsBrian Davis, Kaarel Kaljurand, Tobias Kuhn
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages12
Volume8625 LNAI
ISBN (Print)9783319102221
Publication statusPublished - 2014
Event4th International Workshop on Controlled Natural Language (CNL) - Galway, Ireland
Duration: 20 Aug 201422 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8625 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Controlled Natural Language (CNL)

Fingerprint Dive into the research topics of 'Controlled natural language processing as answer set programming: An experiment'. Together they form a unique fingerprint.

Cite this