{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:22:36Z","timestamp":1792070556537,"version":"4.4.0"},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"3-4","license":[{"start":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T00:00:00Z","timestamp":1533859200000},"content-version":"unspecified","delay-in-days":40,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1017\/s1471068418000327","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T05:44:17Z","timestamp":1533879857000},"page":"691-705","source":"Crossref","is-referenced-by-count":10,"title":["Specifying and Verbalising Answer Set Programs in Controlled Natural Language"],"prefix":"10.1017","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8998-7005","authenticated-orcid":false,"given":"ROLF","family":"SCHWITTER","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"key":"S1471068418000327_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_30"},{"key":"S1471068418000327_ref9","doi-asserted-by":"crossref","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume-title":"Answer Set Solving in Practice","author":"Gebser","year":"2012"},{"key":"S1471068418000327_ref27","volume-title":"The Art of Prolog, Advanced Programming Techniques","author":"Sterling","year":"1994"},{"key":"S1471068418000327_ref5","doi-asserted-by":"crossref","unstructured":"Demirel E. , Gur K. D. , and Erdem E. 2016. Human-Robot Interaction in a Shopping Mall: A CNL Approach. CNL 2016, 111\u2013122.","DOI":"10.1007\/978-3-319-41498-0_11"},{"key":"S1471068418000327_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068418000327_ref3","unstructured":"Baral C. , Dzifcak J. , Gonzalez M. A. and Zhou J. 2011. Using Inverse \u03bb and Generalization to Translate English to Formal Languages. Proceedings of the Ninth International Conference in Computational Semantics, 35\u201344."},{"key":"S1471068418000327_ref16","unstructured":"Kuhn T. 2007. AceRules: Executing Rules in Controlled Natural Language. Proceedings of the First International Conference on Web Reasoning and Rule Systems (RR2007), LNCS, 299\u2013308."},{"key":"S1471068418000327_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511519857"},{"key":"S1471068418000327_ref24","unstructured":"Sch\u00fcller P. 2014. Tackling Winograd Schemas by Formalizing Relevance Theory in Knowledge Graphs. International Conference on the Principles of Knowledge Representation and Reasoning (KR), 358\u2013367."},{"key":"S1471068418000327_ref6","doi-asserted-by":"crossref","unstructured":"Erdem E. and Yeniterzi R. 2009. Transforming controlled natural language biomedical queries into answer set programs. Proceedings of the Workshop on BioNLP, 117\u2013124.","DOI":"10.3115\/1572364.1572381"},{"key":"S1471068418000327_ref19","unstructured":"Nguyen H. V. , Mitra A. and Baral C. 2015. The NL2KR Platform for building Natural Language Translation Systems. Proceedings of ACL, 899\u2013908."},{"key":"S1471068418000327_ref25","doi-asserted-by":"crossref","unstructured":"Schwitter R. 2008. Working for Two: a Bidirectional Grammar for a Controlled Natural Language. Proceedings of AI 2008, LNAI 5360, 168\u2013179.","DOI":"10.1007\/978-3-540-89378-3_17"},{"key":"S1471068418000327_ref18","unstructured":"Lifschitz V. 2008. What is Answer Set Programming? Proceedings of AAAI, 1594\u20131597."},{"key":"S1471068418000327_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000598"},{"key":"S1471068418000327_ref20","doi-asserted-by":"crossref","unstructured":"Pereira F. C. N. and Warren D. H. D. 1980. Definite Clause Grammars for Language Analysis \u2013 A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence, No. 13, 231\u2013278.","DOI":"10.1016\/0004-3702(80)90003-X"},{"key":"S1471068418000327_ref28","unstructured":"Tari L. and Baral C. 2005. Using AnsProlog with Link Grammar and WordNet for QA with deep reasoning. AAAI Spring Symposium Workshop on Inference for Textual Question Answering."},{"key":"S1471068418000327_ref4","unstructured":"Clark P. , Harrison P. , Jenkins T. , Thompson J. and Wojcik R. 2005. Acquiring and Using World Knowledge using a Restricted Subset of English. The 18th International FLAIRS Conference (FLAIRS'05), 506\u2013511."},{"key":"S1471068418000327_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10579-016-9338-7"},{"key":"S1471068418000327_ref21","volume-title":"Prolog and Natural-Language Analysis","author":"Pereira","year":"1987"},{"key":"S1471068418000327_ref14","volume-title":"New Concepts in Natural Language Generation: Planning, Realization and Systems","author":"Horacek","year":"2015"},{"key":"S1471068418000327_ref26","unstructured":"Sowa J. F. 2004. Common Logic Controlled English. Draft, available at: http:\/\/www.jfsowa.com\/clce\/specs.htm, 24 February 2004."},{"key":"S1471068418000327_ref1","unstructured":"Bailey D. , Harrison A. , Lierler Y. , Lifschitz V. and Michael J. 2015. The Winograd Schema Challenge and Reasoning about Correlation. Working Notes of the Symposium on Logical Formalizations of Commonsense Reasoning."},{"key":"S1471068418000327_ref15","volume-title":"From Discourse to Logic","author":"Kamp","year":"1993"},{"key":"S1471068418000327_ref8","unstructured":"Fuchs N. E. , Kaljurand K. and Kuhn T. 2008. Attempto Controlled English for Knowledge Representation. Reasoning Web, Fourth International Summer School 2008, LNCS 5224, 104\u2013124."},{"key":"S1471068418000327_ref10","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , Lindauer M. , Ostrowski M. , Romero J. , Schaub T. and Thiele S. 2017. Potassco User Guide, Version 2.1.0, available at: https:\/\/github.com\/potassco\/guide\/releases\/, October 2017."},{"key":"S1471068418000327_ref11","unstructured":"Gelfond M. and Lifschitz V. 1988. The Stable Model Semantics for Logic Programming. Proceedings of the Fifth International Conference on Logic Programming (ICLP), 1070\u20131080."},{"key":"S1471068418000327_ref23","unstructured":"Sch\u00fcller P. 2013. Flexible Combinatory Categorial Grammar using the CYK Algorithm and Answer Set Programming. LPNMR, 499\u2013511."},{"key":"S1471068418000327_ref12","unstructured":"Geurts B. , Beaver D. I. and Maier E. 2015. Discourse Representation Theory. Stanford Encyclopedia of Philosophy, available at: https:\/\/plato.stanford.edu\/entries\/discourse-representation-theory\/, 24th December, 2015."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068418000327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T15:17:47Z","timestamp":1555255067000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000327\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":28,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S1471068418000327"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000327","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}