{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T05:11:02Z","timestamp":1677993062636},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transinf.2022fcl0001","type":"journal-article","created":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T22:20:17Z","timestamp":1677622817000},"page":"333-336","source":"Crossref","is-referenced-by-count":0,"title":["Choice Disjunctive Queries in Logic Programming"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Keehang","family":"KWON","sequence":"first","affiliation":[{"name":"Computer Eng., DongA University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daeseong","family":"KANG","sequence":"additional","affiliation":[{"name":"Electronics Eng., DongA University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] G. Kahn, \u201cNatural semantics,\u201d 4th Annual Symposium on Theoretical Aspects of Computer Science, LNCS vol.247, 1987."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] G. Japaridze, \u201cIntroduction to computability logic,\u201d Annals of Pure and Applied Logic, vol.123, no.1-3, pp.1-99, 2003. 10.1016\/s0168-0072(03)00023-x","DOI":"10.1016\/S0168-0072(03)00023-X"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] G. Japaridze, \u201cSequential operators in computability logic,\u201d Information and Computation, vol.206, no.12, pp.1443-1475, 2008. 10.1016\/j.ic.2008.10.001","DOI":"10.1016\/j.ic.2008.10.001"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] G. Japaridze, Propositional computability logic I, ACM Transactions on Computational Logic, vol.7, no.2, pp.302-330, 2006. 10.1145\/1131313.1131318","DOI":"10.1145\/1131313.1131318"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G. Japaridze, Propositional computability logic II, ACM Transactions on Computational Logic, vol.7, no.2, pp.331-362, 2006. 10.1145\/1131313.1131319","DOI":"10.1145\/1131313.1131319"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] G. Japaridze, Towards applied theories based on computability logic, Journal of Symbolic Logic, vol.75, no.2, pp.565-601, 2010. 10.2178\/jsl\/1268917495","DOI":"10.2178\/jsl\/1268917495"},{"key":"7","unstructured":"[7] G. Japaridze, \u201cOn the system CL12 of computability logic,\u201d http:\/\/arxiv.org\/abs\/1203.0103, June 2013."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J.-Y. Girard, \u201cLinear Logic,\u201d Theoretical Computer Science, vol.50, no.1, pp.1-102, 1987. 10.1016\/0304-3975(87)90045-4","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] J.S. Hodas and D. Miller, \u201cLogic Programming in a Fragment of Intuitionistic Linear Logic,\u201d Information and Computation, vol.110, no.2, pp.327-365, 1994. 10.1006\/inco.1994.1036","DOI":"10.1006\/inco.1994.1036"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] J. Kriener and A. King, \u201cRedAlert: Determinacy Inference for Prolog,\u201d Theory and Practice of Logic Programming, vol.11, no.4-5, pp.537-553, 2011. 10.1017\/s1471068411000160","DOI":"10.1017\/S1471068411000160"},{"key":"11","unstructured":"[11] E. Komendantskaya and V. Komendantsky, \u201cOn uniform proof-theoretical operational semantics for logic programming,\u201d ed. J.-Y. Beziau and A.Costa-Leite, Perspectives on Universal Logic, pp.379-394, Polimetrica Publisher, 2007."},{"key":"12","unstructured":"[12] K. Kwon and S. Hur, \u201cAdding sequential conjunctions to prolog,\u201d International Journal of Computer Technology and Applications, vol.1, no.1, pp.1-3, 2010."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] S.W. Loke and A. Davison, LogicWeb: Enhancing the Web with Logic Programming, Journal of Logic Programming, vol.36, no.3, pp.195-240, 1998. 10.1016\/s0743-1066(98)00002-8","DOI":"10.1016\/S0743-1066(98)00002-8"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] D. Miller, \u201cA Survey of the Proof-Theoretic Foundations of Logic Programming,\u201d 20th Anniversary Issue of the Theory and Practice of Logic Programming, vol.22, no.6, pp.859-904, 2022. 10.1017\/s1471068421000533","DOI":"10.1017\/S1471068421000533"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, \u201cUniform proofs as a foundation for logic programming,\u201d Annals of Pure and Applied Logic, vol.51, no.1-2, pp.125-157, 1991. 10.1016\/0168-0072(91)90068-w","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] A. Porto, \u201cA structured alternative to Prolog with simple compositional semantics,\u201d Theory and Practice of Logic Programming, vol.11, no.4-5, pp.611-627, 2011. 10.1017\/s1471068411000202","DOI":"10.1017\/S1471068411000202"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Saurin, \u201cTowards Ludics Programming: Interactive Proof Search,\u201d International Conference on Logic Programming, pp.253-268, 2008. 10.1007\/978-3-540-89982-2_27","DOI":"10.1007\/978-3-540-89982-2_27"},{"key":"18","unstructured":"[18] M.D. Winikoff, \u201cLogic programming with linear logic,\u201d Ph.D. thesis, Univ. Melbourne, 1997."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/3\/E106.D_2022FCL0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T04:15:41Z","timestamp":1677903341000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/3\/E106.D_2022FCL0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022fcl0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022FCL0001"}}