{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:06:11Z","timestamp":1698037571166},"reference-count":12,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T00:00:00Z","timestamp":1174521600000},"content-version":"vor","delay-in-days":5924,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Mode information (directional information concerning the arguments of predicates) is important in improving the speed of the execution of logic programs. This paper proposes a bidirectional inference algorithm for inferring precise mode information. Compared with the conventional inference algorithms, the proposed algorithm has the following two features: (1) the algorithm utilizes not only the modes of the predicates at the top level but also the modes of the built\u2010in predicates used in the program; and (2) by propagating the modes of the top level predicates top\u2010down and that of the built\u2010in predicates bottom\u2010up, more precise mode information can be inferred.<\/jats:p>","DOI":"10.1002\/scj.4690220401","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T20:53:14Z","timestamp":1183841594000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Bidirectional inference of mode information for logic programs"],"prefix":"10.1002","volume":"22","author":[{"given":"Neng\u2010Fa","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Ushijima","sequence":"additional","affiliation":[]},{"given":"Toshihisa","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,22]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"M.Bruynooghe B.Demoen A.Callebaut andG.Jansens.Abstract interpretation: Toward the global optimization of Prolog programs. Proc. 4th IEEE Symposium on Logic Programming San Francisco pp.192\u2013204(1987)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(88)90010-6"},{"key":"e_1_2_1_4_2","unstructured":"S. W.Dietrich.Extension tables: Memo relations in logic programming. Proc. 4th IEEE Symposium on Logic Programming San Francisco pp.264\u2013272(1987)."},{"key":"e_1_2_1_5_2","first-page":"104","article-title":"An optimizing Prolog compiler","volume":"264","author":"Komatsu H.","year":"1986","journal-title":"LNCS"},{"key":"e_1_2_1_6_2","unstructured":"C. W.Kwok.A survey of structuring mechanisms for logic programs. Proc. Int. Comput. Science Conf. Hong Kong pp.179\u2013188(1988)."},{"key":"e_1_2_1_7_2","unstructured":"C. S.Mellish.The automatic generation of mode declarations for Prolog programs. DAI Research Paper 163 Depart. Artif."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(85)90004-4"},{"key":"e_1_2_1_9_2","unstructured":"H.MannilaandE.Ukkonen.Flow analysis of Prolog programs. Proc. 4th IEEE Symposium on Logic Programming San Francisco pp.205\u2013214(1987)."},{"key":"e_1_2_1_10_2","unstructured":"U. S.Reddy.Transformation of logic programs into functional programs. Proc. 1984 Int. Symposium on Logic Programming. IEEE Computer Society pp.187\u2013196(1984)."},{"key":"e_1_2_1_11_2","volume-title":"The Art of Prolog","author":"Sterling L.","year":"1986"},{"key":"e_1_2_1_12_2","unstructured":"D. H. D.Warren.Implementing PROLOG\u2014compiling predicate logic programs. Dept. Artif. Intell. Research Report Nos. 39 and 40 University of Edinburgh (1977)."},{"key":"e_1_2_1_13_2","unstructured":"N. F.Zhou T.Takagi andK.Ushijima.Improving the efficiency of Prolog programs by using matching instead of unification. Proc. Int. Comput. Symposium Taipei pp.653\u2013658(1988)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690220401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T02:36:22Z","timestamp":1698028582000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690220401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/scj.4690220401"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690220401","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}