{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T04:35:26Z","timestamp":1723264526817},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":43,"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":[[2016,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Word puzzles and the problem of their representations in logic languages have received considerable attention in the last decade (Ponnuru<jats:italic>et al<\/jats:italic>. 2004; Shapiro 2011; Baral and Dzifcak 2012; Schwitter 2013). Of special interest is the problem of generating such representations directly from natural language (NL) or controlled natural language (CNL). An interesting variation of this problem, and to the best of our knowledge, scarcely explored variation in this context, is when the input information is inconsistent. In such situations, the existing encodings of word puzzles produce inconsistent representations and break down. In this paper, we bring the well-known type of paraconsistent logics, called<jats:italic>Annotated Predicate Calculus<\/jats:italic>(APC) (Kifer and Lozinskii 1992), to bear on the problem. We introduce a new kind of non-monotonic semantics for APC, called<jats:italic>consistency preferred stable models<\/jats:italic>and argue that it makes APC into a suitable platform for dealing with inconsistency in word puzzles and, more generally, in NL sentences. We also devise a number of general principles to help the user choose among the different representations of NL sentences, which might seem equivalent but, in fact, behave differently when inconsistent information is taken into account. These principles can be incorporated into existing CNL translators, such as Attempto Controlled English (ACE) (Fuchs<jats:italic>et al<\/jats:italic>. 2008) and PENG Light (White and Schwitter 2009). Finally, we show that APC with the consistency preferred stable model semantics can be equivalently embedded in ASP with preferences over stable models, and we use this embedding to implement this version of APC in Clingo (Gebser<jats:italic>et al<\/jats:italic>. 2011) and its Asprin add-on (Brewka<jats:italic>et al<\/jats:italic>. 2015).<\/jats:p>","DOI":"10.1017\/s1471068416000326","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T21:28:20Z","timestamp":1476566900000},"page":"703-720","source":"Crossref","is-referenced-by-count":2,"title":["Paraconsistency and word puzzles"],"prefix":"10.1017","volume":"16","author":[{"given":"TIANTIAN","family":"GAO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAUL","family":"FODOR","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL","family":"KIFER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"S1471068416000326_ref11","volume-title":"Handbook of Paraconsistency (Studies in Logic)","author":"Beziau","year":"2007"},{"key":"S1471068416000326_ref20","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/3-540-45402-0_38","volume-title":"Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings","author":"Syrj\u00e4nen","year":"2001"},{"key":"S1471068416000326_ref21","first-page":"80","volume-title":"Proceedings of ALTA","author":"White","year":"2009"},{"key":"S1471068416000326_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-1161-7_2"},{"key":"S1471068416000326_ref6","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093891487"},{"key":"S1471068416000326_ref14","first-page":"437","volume-title":"Proceedings of the International Conference on Artificial Intelligence, IC-AI '04, June 21-24, 2004, Las Vegas, Nevada, USA, Volume 1","author":"Ponnuru","year":"2004"},{"key":"S1471068416000326_ref8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/978-3-540-85658-0_3","volume-title":"Reasoning Web, 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures","author":"Fuchs","year":"2008"},{"key":"S1471068416000326_ref15","volume-title":"The Stanford Encyclopedia of Philosophy","author":"Priest","year":"2015"},{"key":"S1471068416000326_ref22","volume-title":"Automated reasoning: Introduction and applications","author":"Wos","year":"1984"},{"key":"S1471068416000326_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90126-6"},{"key":"S1471068416000326_ref1","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012","author":"Baral","year":"2012"},{"key":"S1471068416000326_ref5","volume-title":"Programmation lin\u00e9aire - 65 probl\u00e8mes d'optimisation mod\u00e9lis\u00e9s et r\u00e9solus avec Visual Xpress","author":"C. Gu\u00e9ret","year":"2000"},{"key":"S1471068416000326_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00245460"},{"key":"S1471068416000326_ref7","doi-asserted-by":"publisher","DOI":"10.1002\/spe.623"},{"key":"S1471068416000326_ref18","volume-title":"Logical Formalizations of Commonsense Reasoning, Papers from the 2011 AAAI Spring Symposium, California, USA, March 21-23, 2011","author":"Shapiro","year":"2011"},{"key":"S1471068416000326_ref10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: The Potsdam answer set solving collection.","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Communications"},{"key":"S1471068416000326_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90007-P"},{"key":"S1471068416000326_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000306"},{"key":"S1471068416000326_ref9","unstructured":"Gao T. , Fodor P. and Kifer M. 2016. Paraconsistency and Word Puzzles. ArXiv e-prints http:\/\/arxiv.org\/abs\/1608.01338, 1\u201330."},{"key":"S1471068416000326_ref19","volume-title":"Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Proceedings of the 1st Intl. ASP'01 Workshop, Stanford, March 26-28, 2001","author":"Soininen","year":"2001"},{"key":"S1471068416000326_ref17","first-page":"510","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues, 8th International Conference on Conceptual Structures, ICCS 2000, Darmstadt, Germany, August 14-18, 2000, Proceedings","author":"Shapiro","year":"2000"},{"key":"S1471068416000326_ref4","first-page":"1467","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA.","author":"Brewka","year":"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\/S1471068416000326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T17:49:13Z","timestamp":1601142553000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000326\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":22,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S1471068416000326"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000326","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}