Specifying weak constraints in Processable English

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

Abstract

Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.

LanguageEnglish
Title of host publicationProceedings of the Australasian Computer Science Week Multiconference, ACSW 2019
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Number of pages4
ISBN (Electronic)9781450366038
DOIs
Publication statusPublished - 29 Jan 2019
Event2019 Australasian Computer Science Week Multiconference - Sydney, Australia
Duration: 29 Jan 201931 Jan 2019

Conference

Conference2019 Australasian Computer Science Week Multiconference
Abbreviated titleACSW 2019
CountryAustralia
CitySydney
Period29/01/1931/01/19

Fingerprint

Specifications

Keywords

  • answer set programming
  • Controlled languages
  • specifications

Cite this

Schwitter, R. (2019). Specifying weak constraints in Processable English. In Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019 [56] New York: Association for Computing Machinery. https://doi.org/10.1145/3290688.3290699
Schwitter, Rolf. / Specifying weak constraints in Processable English. Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019. New York : Association for Computing Machinery, 2019.
@inproceedings{98040071a3bf4c4d97751a5774f85f42,
title = "Specifying weak constraints in Processable English",
abstract = "Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.",
keywords = "answer set programming, Controlled languages, specifications",
author = "Rolf Schwitter",
year = "2019",
month = "1",
day = "29",
doi = "10.1145/3290688.3290699",
language = "English",
booktitle = "Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019",
publisher = "Association for Computing Machinery",

}

Schwitter, R 2019, Specifying weak constraints in Processable English. in Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019., 56, Association for Computing Machinery, New York, 2019 Australasian Computer Science Week Multiconference, Sydney, Australia, 29/01/19. https://doi.org/10.1145/3290688.3290699

Specifying weak constraints in Processable English. / Schwitter, Rolf.

Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019. New York : Association for Computing Machinery, 2019. 56.

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

TY - GEN

T1 - Specifying weak constraints in Processable English

AU - Schwitter, Rolf

PY - 2019/1/29

Y1 - 2019/1/29

N2 - Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.

AB - Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.

KW - answer set programming

KW - Controlled languages

KW - specifications

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

U2 - 10.1145/3290688.3290699

DO - 10.1145/3290688.3290699

M3 - Conference proceeding contribution

BT - Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019

PB - Association for Computing Machinery

CY - New York

ER -

Schwitter R. Specifying weak constraints in Processable English. In Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019. New York: Association for Computing Machinery. 2019. 56 https://doi.org/10.1145/3290688.3290699