Controlled Natural Language Processing as Answer Set Programming: an Experiment

by   Rolf Schwitter, et al.

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.



page 1

page 2

page 3

page 4


ASP-Core-2 Input Language Format

Standardization of solver input languages has been a main driver for the...

Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report

Combinatory categorial grammar (CCG) is a grammar formalism used for nat...

Backdoors to Tractable Answer-Set Programming

Answer Set Programming (ASP) is an increasingly popular framework for de...

Probabilistic Inductive Logic Programming Based on Answer Set Programming

We propose a new formal language for the expressive representation of pr...

Architecture of a Web-based Predictive Editor for Controlled Natural Language Processing

In this paper, we describe the architecture of a web-based predictive te...

Knowledge-and-Data-Driven Amplitude Spectrum Prediction for Hierarchical Neural Vocoders

In our previous work, we have proposed a neural vocoder called HiNet whi...

Justifications for Goal-Directed Constraint Answer Set Programming

Ethical and legal concerns make it necessary for programs that may direc...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.