{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:37Z","timestamp":1762101757751},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T00:00:00Z","timestamp":1441756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"NFS","award":["IIS-1018031 and CNS-1359359"],"award-info":[{"award-number":["IIS-1018031 and CNS-1359359"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts . This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.<\/jats:p>","DOI":"10.1093\/logcom\/exv065","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T05:13:30Z","timestamp":1441948410000},"page":"953-989","source":"Crossref","is-referenced-by-count":12,"title":["The language of epistemic specifications (refined) including a prototype solver"],"prefix":"10.1093","volume":"30","author":[{"given":"Patrick","family":"Kahl","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]},{"given":"Richard","family":"Watson","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]},{"given":"Evgenii","family":"Balai","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]},{"given":"Michael","family":"Gelfond","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]},{"given":"Yuanlin","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Computer Science, Texas Tech University"}]}],"member":"286","published-online":{"date-parts":[[2015,9,9]]},"reference":[{"key":"2020062122333822100_B1"},{"key":"2020062122333822100_B2"},{"key":"2020062122333822100_B3"},{"key":"2020062122333822100_B4"},{"key":"2020062122333822100_B5"},{"key":"2020062122333822100_B6"},{"key":"2020062122333822100_B7","first-page":"257","volume-title":"Reasoning agents in dynamic domains","author":"Baral","year":"2000"},{"key":"2020062122333822100_B8","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/69.877512","article-title":"Enhancing disjunctive datalog by constraints","volume":"12","author":"Buccafurri","year":"2000","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2020062122333822100_B9","first-page":"1823","article-title":"ESParser: an epistemic specification grounder","volume-title":"CSSS-12","author":"Cui","year":"2012"},{"key":"2020062122333822100_B10"},{"key":"2020062122333822100_B11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0004-3702(02)00367-3","article-title":"A logic programming approach to knowledge-state planning, II: The \nDLVK\n        system","volume":"144","author":"Eiter","year":"2003","journal-title":"Artificial Intelligence"},{"key":"2020062122333822100_B12"},{"key":"2020062122333822100_B13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"Fagin","year":"2004"},{"key":"2020062122333822100_B14","first-page":"386","article-title":"Strong introspection","volume-title":"AAAI-91","author":"Gelfond","year":"1991"},{"key":"2020062122333822100_B15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01530762","article-title":"Logic programming and reasoning with incomplete information","volume":"12","author":"Gelfond","year":"1994","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2020062122333822100_B16"},{"key":"2020062122333822100_B17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach","author":"Gelfond","year":"2014"},{"key":"2020062122333822100_B18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","article-title":"Nonmonotonic logic and temporal projection","volume":"33","author":"Hanks","year":"1987","journal-title":"Artificial Intelligence"},{"key":"2020062122333822100_B19","volume-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"2020062122333822100_B20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1018978005636","article-title":"Nested expressions in logic programs","volume":"25","author":"Lifschitz","year":"1999","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2020062122333822100_B21"},{"key":"2020062122333822100_B22"},{"key":"2020062122333822100_B23"},{"key":"2020062122333822100_B24"},{"key":"2020062122333822100_B25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2010.04.007","article-title":"Approximation of action theories and its application to conformant planning","volume":"175","author":"Tu","year":"2011","journal-title":"Artificial Intelligence"},{"key":"2020062122333822100_B26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0743-1066(96)00125-2","article-title":"Representing actions in logic programs and default theories: a situation calculus approach","volume":"31","author":"Turner","year":"1997","journal-title":"Journal of Logic Programming"},{"key":"2020062122333822100_B27"},{"key":"2020062122333822100_B28"},{"key":"2020062122333822100_B29","first-page":"308","article-title":"Computational properties of epistemic logic programs","volume-title":"KR-06","author":"Zhang","year":"2006"},{"key":"2020062122333822100_B30"},{"key":"2020062122333822100_B31","first-page":"769","article-title":"ESmodels: an inference engine of epistemic specifications","volume-title":"ICTAI 2013","author":"Zhang","year":"2013"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/953\/33410510\/exv065.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/953\/33410510\/exv065.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T02:33:52Z","timestamp":1592793232000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/4\/953\/2917840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,9]]},"references-count":31,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,9,9]]},"published-print":{"date-parts":[[2020,6,5]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv065","relation":{},"ISSN":["1465-363X","0955-792X"],"issn-type":[{"value":"1465-363X","type":"electronic"},{"value":"0955-792X","type":"print"}],"subject":[],"published-other":{"date-parts":[[2020,6]]},"published":{"date-parts":[[2015,9,9]]}}}