{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T05:40:31Z","timestamp":1698385231651},"reference-count":18,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4462,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper proposes a method using the hypothetical reasoning for locating missing high cards in the game of bridge. Beginner knowledge for bidding and leading cards is represented by constraint logic programming language CHIP. Observation as to whether one leads with the king of hearts is given as a part of query. Then hypothesizing as to the possession of the ace of hearts is generated by abduction and integrity constraints are checked by consistency techniques in CHIP. A system based on beginners' knowledge is as powerful as an expert system used for the same purpose.<\/jats:p>","DOI":"10.1002\/scj.4690260903","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T09:20:52Z","timestamp":1183886452000},"page":"23-33","source":"Crossref","is-referenced-by-count":0,"title":["Application of abduction to computer bridge"],"prefix":"10.1002","volume":"26","author":[{"given":"Takao","family":"Uehara","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"B.Gamback M.RaynerandP.Barney.Pragmatic reasoning in bridge. Technical Report No. 299 University of Cambridge Computer Laboratory (1993)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"A.Wasserman.Realization of skillful bridge bidding program.Proc. FJCC pp.433\u2013444(1970).","DOI":"10.1145\/1478462.1478525"},{"key":"e_1_2_1_4_2","unstructured":"A.Stanier.BRIBIP: A bridge bidding program.Proc. IJCAI pp.374\u2013378(1975)."},{"key":"e_1_2_1_5_2","volume-title":"COBRA: The computer\u2010designed bidding system","author":"Lindeloef E.","year":"1983"},{"key":"e_1_2_1_6_2","unstructured":"E. R.Berlekamp.Machine solution of notrump double\u2010dummy bridge problems.Master thesis MIT (1962)."},{"key":"e_1_2_1_7_2","unstructured":"J. R.Quinlan.A knowledge\u2010based system for locating missing high cards in bridge.Proc. IJCAI pp.705\u2013710(1979)."},{"key":"e_1_2_1_8_2","unstructured":"L.SterlingandY.Nygate.PYTHON: An expert squeezer.Proc. ICLP pp.654\u2013674(1987)."},{"key":"e_1_2_1_9_2","unstructured":"T.UchidaandY.Uchida.Micro Bridge.Version 6 User's Manual(1992)."},{"key":"e_1_2_1_10_2","unstructured":"A.Bracher.Oxford Bridge. (Version 3) Thinking Games (1985)."},{"key":"e_1_2_1_11_2","volume-title":"How to read your opponent's cards: The bridge experts' way to locate missing high cards","author":"Lawrence M.","year":"1973"},{"key":"e_1_2_1_12_2","unstructured":"C. H.Goren.Goren's new bridge complete.Doubleday(1985)."},{"key":"e_1_2_1_13_2","unstructured":"Let's play bridge! Pamphlet from Japan Contract Bridge League Inc."},{"issue":"1","key":"e_1_2_1_14_2","first-page":"48","article-title":"Principles of abduction","volume":"7","author":"Inoue K.","year":"1992","journal-title":"Journal of Japanese Society for Artificial Intelligence"},{"key":"e_1_2_1_15_2","unstructured":"M.Dincbas P.van Hentenryck H.Simonis A.AggounandT.Graf.The constraint logic programming language CHIP.Proc. FGCS pp.693\u2013702(1988)."},{"key":"e_1_2_1_16_2","unstructured":"ICL Decision Power. DP 1.00 CHIP Reference Manual (1990)."},{"issue":"1","key":"e_1_2_1_17_2","first-page":"22","article-title":"Hypothetical reasoning","volume":"2","author":"Kunifuji S.","year":"1987","journal-title":"Journal of Japanese Society for Artificial Intelligence"},{"key":"e_1_2_1_18_2","volume-title":"Speed\u2010up of hypothetical reasoning. Tutorial (Hypothetical reasoning)","author":"Ishizuska M.","year":"1991"},{"key":"e_1_2_1_19_2","unstructured":"T.Uehara.Application of abduction to computer bridge.Technical Report of I.E.I.C.E. AI93\u201068 PRU93\u201085 (1993)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690260903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690260903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T22:36:57Z","timestamp":1698359817000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690260903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":18,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/scj.4690260903"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690260903","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}