{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:38:55Z","timestamp":1775695135430,"version":"3.50.1"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"unspecified","delay-in-days":11,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Knowledge representation and reasoning (KRR) systems describe and reason with complex concepts and relations in the form of facts and rules. Unfortunately, wide deployment of KRR systems runs into the problem that domain experts have great difficulty constructing correct logical representations of their domain knowledge. Knowledge engineers can help with this construction process, but there is a deficit of such specialists. The earlier Knowledge Authoring Logic Machine (KALM) based on Controlled Natural Language (CNL) was shown to have very high accuracy for authoring facts and questions. More recently, KALM<jats:sup>FL<\/jats:sup>, a successor of KALM, replaced CNL with <jats:italic>factual<\/jats:italic> English, which is much less restrictive and requires very little training from users. However, KALM<jats:sup>FL<\/jats:sup> has limitations in representing certain types of knowledge, such as authoring rules for multi-step reasoning or understanding actions with timestamps. To address these limitations, we propose KALM<jats:sup>RA<\/jats:sup> to enable authoring of rules and actions. Our evaluation using the UTI guidelines benchmark shows that KALM<jats:sup>RA<\/jats:sup> achieves a high level of correctness (100%) on rule authoring. When used for authoring and reasoning with actions, KALM<jats:sup>RA<\/jats:sup> achieves more than 99.3% correctness on the bAbI benchmark, demonstrating its effectiveness in more sophisticated KRR jobs. Finally, we illustrate the logical reasoning capabilities of KALM<jats:sup>RA<\/jats:sup> by drawing attention to the problems faced by the recently made famous AI, ChatGPT.<\/jats:p>","DOI":"10.1017\/s1471068423000169","type":"journal-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T08:54:05Z","timestamp":1689152045000},"page":"797-811","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["Knowledge Authoring for Rules and Actions"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0841-9796","authenticated-orcid":false,"given":"YUHENG","family":"WANG","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2978-676X","authenticated-orcid":false,"given":"PAUL","family":"FODOR","sequence":"additional","affiliation":[]},{"given":"MICHAEL","family":"KIFER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"S1471068423000169_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068423000169_ref7","doi-asserted-by":"crossref","unstructured":"Gao, T. , Fodor, P. and Kifer, M. 2018b. Knowledge authoring for rule-based reasoning. In OTM Confederated International Conferences on the Move to Meaningful Internet Systems. Springer, 461\u2013480.","DOI":"10.1007\/978-3-030-02671-4_28"},{"key":"S1471068423000169_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83397-7_2"},{"key":"S1471068423000169_ref14","unstructured":"Le, H. , Tran, T. and Venkatesh, S. 2020. Self-attentive associative memory. In International Conference on Machine Learning. PMLR, 5682\u20135691."},{"key":"S1471068423000169_ref1","doi-asserted-by":"crossref","unstructured":"Baker, C. F. , Fillmore, C. J. and Lowe, J. B. 1998. The berkeley framenet project. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics. COLING, 86\u201390.","DOI":"10.3115\/980845.980860"},{"key":"S1471068423000169_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210335"},{"key":"S1471068423000169_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"S1471068423000169_ref3","first-page":"373","article-title":"Frame semantics","volume":"34","author":"Fillmore","year":"2006","journal-title":"Cognitive Linguistics: Basic Readings"},{"key":"S1471068423000169_ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10354"},{"key":"S1471068423000169_ref18","unstructured":"Ringgaard, M. , Gupta, R. and Pereira, F. C. 2017. Sling: A framework for frame semantic parsing. arXiv preprint arXiv:1710.07032."},{"key":"S1471068423000169_ref19","unstructured":"Sadri, F. and Kowalski, R. A. 1995. Variants of the event calculus. In ICLP, 67\u201381."},{"key":"S1471068423000169_ref21","volume-title":"International Workshop on Controlled Natural Language","author":"Shiffman","year":"2009"},{"key":"S1471068423000169_ref24","doi-asserted-by":"crossref","unstructured":"Wan, H. , Grosof, B. N. , Kifer, M. , Fodor, P. and Liang, S. 2009. Logic programming with defaults and argumentation theories. In Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, 14\u201317 July 2009. Proceedings, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 432\u2013448.","DOI":"10.1007\/978-3-642-02846-5_35"},{"key":"S1471068423000169_ref20","unstructured":"Schwitter, R. 2002. English as a formal specification language. In Proceedings. 13th International Workshop on Database and Expert Systems Applications. IEEE, 228\u2013232."},{"key":"S1471068423000169_ref11","doi-asserted-by":"crossref","unstructured":"Kifer, M. and Lausen, G. 1989. F-logic: A higher-order language for reasoning about objects, inheritance, and scheme. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, 134\u2013146.","DOI":"10.1145\/66926.66939"},{"key":"S1471068423000169_ref4","doi-asserted-by":"crossref","unstructured":"Fuchs, N. E. , Kaljurand, K. and Kuhn, T. 2008. Attempto controlled english for knowledge representation. In Reasoning Web. Springer, 104\u2013124.","DOI":"10.1007\/978-3-540-85658-0_3"},{"key":"S1471068423000169_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000500"},{"key":"S1471068423000169_ref26","unstructured":"Weston, J. , Bordes, A. , Chopra, S. , Rush, A. M. , van Merri\u00ebnboer, B. , Joulin, A. and Mikolov, T. 2015. Towards AI-complete question answering: A set of prerequisite toy tasks. arXiv preprint arXiv:1502.05698."},{"key":"S1471068423000169_ref2","doi-asserted-by":"publisher","DOI":"10.1542\/peds.103.4.843"},{"key":"S1471068423000169_ref9","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In ICLP\/SLP, vol. 88. Cambridge, MA, 1070\u20131080."},{"key":"S1471068423000169_ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-demos.14"},{"key":"S1471068423000169_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068423000169_ref22","unstructured":"Swayamdipta, S. , Thomson, S. , Dyer, C. and Smith, N. A. 2017. Frame-semantic parsing with softmax-margin segmental rnns and a syntactic scaffold. arXiv preprint arXiv:1706.09528."},{"key":"S1471068423000169_ref25","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.364.10"},{"key":"S1471068423000169_ref5","unstructured":"Fuchs, N. E. and Schwitter, R. 1996. Attempto controlled english (ace). arXiv preprint cmplg\/9603003."},{"key":"S1471068423000169_ref6","doi-asserted-by":"crossref","unstructured":"Gao, T. , Fodor, P. and Kifer, M. 2018a. High accuracy question answering via hybrid controlled natural language. In 2018 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI). IEEE, 17\u201324.","DOI":"10.1109\/WI.2018.0-112"}],"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\/S1471068423000169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T09:38:16Z","timestamp":1709026696000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068423000169\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["S1471068423000169"],"URL":"https:\/\/doi.org\/10.1017\/s1471068423000169","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}