Controlled natural language processing as answer set programming: An experiment

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

Abstract

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.

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
Pages8-19
Number of pages12
Volume8625 LNAI
ISBN (Print)9783319102221
DOIs
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

Conference

Conference4th International Workshop on Controlled Natural Language (CNL)
CountryIreland
CityGalway
Period20/08/1422/08/14

Fingerprint

Answer Set Programming
Natural Language
Pipelines
Processing
Experiment
Experiments
Software Components
Parsing
Grammar
Notation
Reasoning

Cite this

Schwitter, R. (2014). Controlled natural language processing as answer set programming: An experiment. In B. Davis, K. Kaljurand, & T. Kuhn (Eds.), Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings (Vol. 8625 LNAI, pp. 8-19). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8625 LNAI). Berlin; Heidelberg: Springer, Springer Nature. https://doi.org/10.1007/978-3-319-10223-8_2
Schwitter, Rolf. / Controlled natural language processing as answer set programming : An experiment. Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings. editor / Brian Davis ; Kaarel Kaljurand ; Tobias Kuhn. Vol. 8625 LNAI Berlin; Heidelberg : Springer, Springer Nature, 2014. pp. 8-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d0249bda9ebc4e50941cc5e8b84fc794,
title = "Controlled natural language processing as answer set programming: An experiment",
abstract = "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.",
author = "Rolf Schwitter",
year = "2014",
doi = "10.1007/978-3-319-10223-8_2",
language = "English",
isbn = "9783319102221",
volume = "8625 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "8--19",
editor = "Brian Davis and Kaarel Kaljurand and Tobias Kuhn",
booktitle = "Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings",
address = "United States",

}

Schwitter, R 2014, Controlled natural language processing as answer set programming: An experiment. in B Davis, K Kaljurand & T Kuhn (eds), Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings. vol. 8625 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8625 LNAI, Springer, Springer Nature, Berlin; Heidelberg, pp. 8-19, 4th International Workshop on Controlled Natural Language (CNL), Galway, Ireland, 20/08/14. https://doi.org/10.1007/978-3-319-10223-8_2

Controlled natural language processing as answer set programming : An experiment. / Schwitter, Rolf.

Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings. ed. / Brian Davis; Kaarel Kaljurand; Tobias Kuhn. Vol. 8625 LNAI Berlin; Heidelberg : Springer, Springer Nature, 2014. p. 8-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8625 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

TY - GEN

T1 - Controlled natural language processing as answer set programming

T2 - An experiment

AU - Schwitter, Rolf

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958530700&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-10223-8_2

DO - 10.1007/978-3-319-10223-8_2

M3 - Conference proceeding contribution

SN - 9783319102221

VL - 8625 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 8

EP - 19

BT - Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings

A2 - Davis, Brian

A2 - Kaljurand, Kaarel

A2 - Kuhn, Tobias

PB - Springer, Springer Nature

CY - Berlin; Heidelberg

ER -

Schwitter R. Controlled natural language processing as answer set programming: An experiment. In Davis B, Kaljurand K, Kuhn T, editors, Controlled Natural Language - 4th International Workshop, CNL 2014, Proceedings. Vol. 8625 LNAI. Berlin; Heidelberg: Springer, Springer Nature. 2014. p. 8-19. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-10223-8_2