Specifying weak constraints in Processable English

Rolf Schwitter

doi:10.1145/3290688.3290699

Specifying weak constraints in Processable English

Rolf Schwitter^*

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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.

Original language	English
Title of host publication	Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019
Place of Publication	New York
Publisher	Association for Computing Machinery
Pages	1-4
Number of pages	4
ISBN (Electronic)	9781450366038
DOIs	https://doi.org/10.1145/3290688.3290699
Publication status	Published - 29 Jan 2019
Event	2019 Australasian Computer Science Week Multiconference - Sydney, Australia Duration: 29 Jan 2019 → 31 Jan 2019

Conference

Conference	2019 Australasian Computer Science Week Multiconference
Abbreviated title	ACSW 2019
Country/Territory	Australia
City	Sydney
Period	29/01/19 → 31/01/19

Keywords

answer set programming
Controlled languages
specifications

Access to Document

10.1145/3290688.3290699

Cite this

@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 = jan,

day = "29",

doi = "10.1145/3290688.3290699",

language = "English",

pages = "1--4",

booktitle = "Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019",

publisher = "Association for Computing Machinery",

note = "2019 Australasian Computer Science Week Multiconference, ACSW 2019 ; Conference date: 29-01-2019 Through 31-01-2019",

}

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 - https://www.scopus.com/pages/publications/85061258691

U2 - 10.1145/3290688.3290699

DO - 10.1145/3290688.3290699

M3 - Conference proceeding contribution

AN - SCOPUS:85061258691

SP - 1

EP - 4

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

PB - Association for Computing Machinery

CY - New York

T2 - 2019 Australasian Computer Science Week Multiconference

Y2 - 29 January 2019 through 31 January 2019

ER -

Specifying weak constraints in Processable English

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this