Specifying and Verbalising Answer Set Programs in Controlled Natural Language

We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answe...

Full description

Saved in:
Bibliographic Details
Published inTheory and practice of logic programming Vol. 18; no. 3-4; pp. 691 - 705
Main Author SCHWITTER, ROLF
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.07.2018
Subjects
Data structures
Grammar
Language
Natural language
Natural language processing
Original Article
Specification and description languages
controlled natural languages
Bi-directional grammars
answer set programming
executable specifications
sentence planning
Online AccessGet full text

Cover

Abstract We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.
AbstractList We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.
Author SCHWITTER, ROLF
Author_xml – sequence: 1
  givenname: ROLF
  orcidid: 0000-0001-8998-7005
  surname: SCHWITTER
  fullname: SCHWITTER, ROLF
  email: Rolf.Schwitter@mq.edu.au
  organization: Department of Computing, Macquarie University, Sydney, NSW 2109, Australia (e-mail: Rolf.Schwitter@mq.edu.au)
BookMark eNp9kNtKw0AQhhepYFt9AO8WvI7OZpNs9rIUT1APUPU2TJJJ2JJu6m6K9O1NbEFQ9Oqfw__NDDNhI9taYuxcwKUAoa6WIlICkjQSKQDIUB2xcV-KAwmpGH3FIhj6J2zi_QpAJDKMxuxhuaHCVDtja4625G_kcmyMH_KZ9R_k-JI6_uza2uHac2P5vLWda5uGSv6I3dZhwxdo6y3WdMqOK2w8nR10yl5vrl_md8Hi6fZ-PlsEhUygC7RMdERlHKcakWJdFVJhkqAWVarSqBAy1pDnsZKoScu4iGQECLIsiUQvcsou9nM3rn3fku-yVbt1tl-ZhZAmIYRKhb1L7V2Fa713VGWF6bAzw_1omkxANvwu-_W7nhQ_yI0za3S7fxl5YHCdO1PW9H3U39QnTNiAVg
CitedBy_id crossref_primary_10_1017_S1471068423000388
Cites_doi 10.1007/978-3-642-30743-0_30
10.1016/0004-3702(80)90003-X
10.1007/s10579-016-9338-7
10.1017/S1471068413000598
10.1007/978-3-319-41498-0_11
10.1017/CBO9780511519857
10.3115/1572364.1572381
10.1017/CBO9780511543357
10.2200/S00457ED1V01Y201211AIM019
10.1007/978-3-540-89378-3_17
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2018
Copyright_xml – notice: Copyright © Cambridge University Press 2018
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068418000327
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Health Research Premium Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList Computer Science Database

CrossRef
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate Specifying and Verbalising Answer Set Programs in Controlled Natural Language
R. Schwitter
EISSN 1475-3081
EndPage 705
ExternalDocumentID 10_1017_S1471068418000327
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQGLB
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c360t-93694ed5589aae59fc37a66a91f8784c13590bb573a9e935c4340a03ddee103d3
IEDL.DBID BENPR
ISSN 1471-0684
IngestDate Fri Jul 25 22:33:06 EDT 2025
Tue Jul 01 03:10:11 EDT 2025
Thu Apr 24 22:54:44 EDT 2025
Tue Jan 21 06:19:07 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3-4
Keywords controlled natural languages
Bi-directional grammars
answer set programming
executable specifications
sentence planning
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c360t-93694ed5589aae59fc37a66a91f8784c13590bb573a9e935c4340a03ddee103d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-8998-7005
OpenAccessLink https://easychair.org/publications/preprint_open/Zc3g
PQID 2086202772
PQPubID 43613
PageCount 15
ParticipantIDs proquest_journals_2086202772
crossref_citationtrail_10_1017_S1471068418000327
crossref_primary_10_1017_S1471068418000327
cambridge_journals_10_1017_S1471068418000327
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20180700
2018-07-00
20180701
PublicationDateYYYYMMDD 2018-07-01
PublicationDate_xml – month: 07
  year: 2018
  text: 20180700
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2018
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068418000327_ref3
S1471068418000327_ref4
S1471068418000327_ref1
S1471068418000327_ref2
S1471068418000327_ref20
S1471068418000327_ref24
S1471068418000327_ref23
S1471068418000327_ref22
S1471068418000327_ref28
S1471068418000327_ref26
S1471068418000327_ref25
Kamp (S1471068418000327_ref15) 1993
Pereira (S1471068418000327_ref21) 1987
Sterling (S1471068418000327_ref27) 1994
Horacek (S1471068418000327_ref14) 2015
S1471068418000327_ref13
S1471068418000327_ref12
S1471068418000327_ref11
S1471068418000327_ref10
S1471068418000327_ref17
S1471068418000327_ref16
Gebser (S1471068418000327_ref9) 2012
S1471068418000327_ref7
S1471068418000327_ref8
S1471068418000327_ref5
S1471068418000327_ref19
S1471068418000327_ref6
S1471068418000327_ref18
References_xml – ident: S1471068418000327_ref18
– volume-title: Prolog and Natural-Language Analysis
  year: 1987
  ident: S1471068418000327_ref21
– ident: S1471068418000327_ref17
  doi: 10.1007/978-3-642-30743-0_30
– ident: S1471068418000327_ref20
  doi: 10.1016/0004-3702(80)90003-X
– volume-title: From Discourse to Logic
  year: 1993
  ident: S1471068418000327_ref15
– ident: S1471068418000327_ref12
– ident: S1471068418000327_ref16
– ident: S1471068418000327_ref13
  doi: 10.1007/s10579-016-9338-7
– ident: S1471068418000327_ref11
– ident: S1471068418000327_ref7
  doi: 10.1017/S1471068413000598
– ident: S1471068418000327_ref5
  doi: 10.1007/978-3-319-41498-0_11
– ident: S1471068418000327_ref4
– ident: S1471068418000327_ref23
– volume-title: The Art of Prolog, Advanced Programming Techniques
  year: 1994
  ident: S1471068418000327_ref27
– ident: S1471068418000327_ref8
– ident: S1471068418000327_ref19
– volume-title: New Concepts in Natural Language Generation: Planning, Realization and Systems
  year: 2015
  ident: S1471068418000327_ref14
– ident: S1471068418000327_ref1
– ident: S1471068418000327_ref22
  doi: 10.1017/CBO9780511519857
– ident: S1471068418000327_ref6
  doi: 10.3115/1572364.1572381
– ident: S1471068418000327_ref2
  doi: 10.1017/CBO9780511543357
– volume-title: Answer Set Solving in Practice
  year: 2012
  ident: S1471068418000327_ref9
  doi: 10.2200/S00457ED1V01Y201211AIM019
– ident: S1471068418000327_ref10
– ident: S1471068418000327_ref25
  doi: 10.1007/978-3-540-89378-3_17
– ident: S1471068418000327_ref26
– ident: S1471068418000327_ref24
– ident: S1471068418000327_ref3
– ident: S1471068418000327_ref28
SSID ssj0016324
Score 2.2250726
Snippet We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 691
SubjectTerms Data structures
Grammar
Language
Natural language
Natural language processing
Original Article
Specification and description languages
Title Specifying and Verbalising Answer Set Programs in Controlled Natural Language
URI https://www.cambridge.org/core/product/identifier/S1471068418000327/type/journal_article
https://www.proquest.com/docview/2086202772
Volume 18
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3Pa8IwFA5TL7vs95ibkxx2GiukJmmT03CikzFFxhzeJE1SGEh1q2P__vLaVJGBp9I0KeEleXl57-X7ELpzRrnVAuDxqDQBC-MkUCG1QRyl3JBO4hYZ-CFH42g4ZS8zPvMOt9ynVVY6sVDUZqnBR-4O6c72hoBj53H1FQBrFERXPYVGDTWcChbu8NV46o8nb5s4AoCRF_eLYsjvEayKawJoNBRCWSjgYAC0Mlt0hd1daldJFzvP4AQdeZMRd8sxPkUHNjtDxxUdA_ar8xyNCi754t4SVpnBH05iAG8I790s_4W6do0nZUZWjj8z3CsT1RfW4LEqEDjwq3dgXqDpoP_eGwaeLSHQNCLrAJj5mDWcC6mU5TLVNFZRpGSYilgwHVIuSZLwmCppJeWaUUYUoU6_2dA96CWqZ8vMXiHMEp6aiDDtfsA6qRQ60saEVqUkTRIim-hhI6m5n_P5vMwXi-f_BNtEpBLmXHvkcSDAWOxrcr9psiphN_ZVblUjtO3Ndr5c7_98gw6dESTKFNwWqq-_f-ytMzTWSRvVxOC57efUH4vgzF0
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEB58HPTiW3ybg17EQtokbXIQEXVddXfxoOKtpkkKgtTHroh_yt9opo9dRNibp9I2Ce1kMplkJt8HsOedcmckwuMxZQMeJlmgQ-aCJM6FpVHmBxnuQ3Z7cfuOXz2Ihwn4bs7CYFplYxNLQ21fDO6R-0W6970x4Bgdv74FyBqF0dWGQqNSi2v39emXbP2jyzPfv_tR1Dq_PW0HNatAYFhMBwEy2HFnhZBKaydUblii41irMJeJ5CZkQtEsEwnTyikmDGecasq8HXChvzDf7iRMc_9zOKJk62IYtUDo8_I0U4LZRJI3UVSEqMaH-CyUuAxBEpsRlsPvOfH3lFDOc60FmKsdVHJSadQiTLhiCeYb8gdS24Jl6JbM9eUpKaILS-59_yCYIt6fFP1PLOsG5KbK_-qTp4KcVmnxz86Sni7xPkin3i5dgbt_keIqTBUvhVsDwjOR25hy4xvgUa6kiY21odM5zbOMqnU4HEoqrUdYP62y05L0j2DXgTbCTE2Nc450G8_jqhwMq7xWIB_jCm81PTT6mpF2box_vQsz7dtuJ-1c9q43Yda7X7JK_t2CqcH7h9v2Ls4g2yn1isDjfyvyD8FCBiw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Specifying+and+Verbalising+Answer+Set+Programs+in+Controlled+Natural+Language&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=SCHWITTER%2C+ROLF&rft.date=2018-07-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=18&rft.issue=3-4&rft.spage=691&rft.epage=705&rft_id=info:doi/10.1017%2FS1471068418000327&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068418000327
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon