{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:08:24Z","timestamp":1768435704226,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319420189","type":"print"},{"value":"9783319420196","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42019-6_1","type":"book-chapter","created":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T22:04:53Z","timestamp":1466978693000},"page":"3-18","source":"Crossref","is-referenced-by-count":1,"title":["Programming in Picat"],"prefix":"10.1007","author":[{"given":"Neng-Fa","family":"Zhou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"1_CR1","series-title":"International Series in Operations Research & Management Science","volume-title":"Handbook on Modelling for Discrete Optimization","author":"GM Appa","year":"2010","unstructured":"Appa, G.M., Pitsoulis, L., Springer, H., Williams, P.: Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science. Springer, New York (2010)"},{"key":"1_CR2","volume-title":"Programming Erlang","author":"J Armstrong","year":"2013","unstructured":"Armstrong, J.: Programming Erlang, 2nd edn. Pragmatic Press, Dallas (2013)","edition":"2"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Dovier, A., Zhou, N.-F.: On modeling planning problems in tabled logic programming. In: Proceedings of the 17th ACM International Symposium on Principles and Practice of Declarative Programming, PPDP 2015, pp. 31\u201342 (2015)","DOI":"10.1145\/2790449.2790521"},{"key":"1_CR4","unstructured":"Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Proceedings of FGCS, pp. 85\u201399. ICOT (1984)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"SK Debray","year":"1989","unstructured":"Debray, S.K.: Static inference of modes and data dependencies in logic programs. ACM Trans. Program. Lang. Syst. 11(3), 418\u2013450 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-319-19686-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"S Dymchenko","year":"2015","unstructured":"Dymchenko, S., Mykhailova, M.: Declaratively solving Google Code Jam problems with Picat. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 50\u201357. Springer, Heidelberg (2015)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-37651-1_6","volume-title":"Programming Logics","author":"M Hanus","year":"2013","unstructured":"Hanus, M.: Functional logic programming: from theory to Curry. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 123\u2013168. Springer, Heidelberg (2013)"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P Hentenryck Van","year":"2002","unstructured":"Van Hentenryck, P.: Constraint and integer programming in OPL. INFORMS J. Comput. 14, 345\u2013372 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"3\u20134","key":"1_CR9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R Kowalski","year":"1971","unstructured":"Kowalski, R., Kuehner, D.: Linear resolution with selection function. Artif. Intell. 2(3\u20134), 227\u2013260 (1971)","journal-title":"Artif. Intell."},{"issue":"8","key":"1_CR10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/1536616.1536637","volume":"52","author":"S Malik","year":"2009","unstructured":"Malik, S., Zhang, L.: Boolean satisfiability: from theoretical hardness to practical success. Commun. ACM 52(8), 76\u201382 (2009)","journal-title":"Commun. ACM"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: CP, pp. 529\u2013543 (2007)","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"1_CR12","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"1_CR13","volume-title":"Concepts, Techniques, and Models of Computer Programming","author":"P Roy Van","year":"2004","unstructured":"Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. MIT Press, Cambridge (2004)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-45619-8_16","volume-title":"Logic Programming","author":"J Schimpf","year":"2002","unstructured":"Schimpf, J.: Logical loops. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 224\u2013238. Springer, Heidelberg (2002)"},{"key":"1_CR15","first-page":"93","volume":"35","author":"DS Warren","year":"1992","unstructured":"Warren, D.S.: Memoing for logic programs. Commun. ACM, Special Sect. Logic Program. 35, 93\u2013111 (1992)","journal-title":"Commun. ACM, Special Sect. Logic Program."},{"issue":"1\u20132","key":"1_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1017\/S1471068411000445","volume":"12","author":"N-F Zhou","year":"2012","unstructured":"Zhou, N.-F.: The language features and architecture of B-Prolog. Theory Pract. Logic Program., Special Issue Prolog Syst. 12(1\u20132), 189\u2013218 (2012)","journal-title":"Theory Pract. Logic Program., Special Issue Prolog Syst."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1017\/S1471068415000216","volume":"15","author":"N-F Zhou","year":"2015","unstructured":"Zhou, N.-F., Bartak, R., Dovier, A.: Planning as tabled logic programming. Theory Pract. Logic Program. 15, 543\u2013558 (2015)","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR18","unstructured":"Zhou, N.-F., Fruhman, J.: A User\u2019s Guide to Picat. http:\/\/picat-lang.org"},{"issue":"4\u20135","key":"1_CR19","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1017\/S1471068412000178","volume":"12","author":"N-F Zhou","year":"2012","unstructured":"Zhou, N.-F., Have, C.T.: Efficient tabling of structured data with enhanced hash-consing. Theory Pract. Logic Program. 12(4\u20135), 547\u2013563 (2012)","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-28228-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"N-F Zhou","year":"2016","unstructured":"Zhou, N.-F., Kjellerstrand, H.: The Picat-SAT compiler. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 48\u201362. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-28228-2_4"},{"key":"1_CR21","series-title":"SpringerBriefs in Intelligent Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-25883-6","volume-title":"Constraint Solving and Planning with Picat","author":"N-F Zhou","year":"2015","unstructured":"Zhou, N.-F., Kjellerstrand, H., Fruhman, J.: Constraint Solving and Planning with Picat. SpringerBriefs in Intelligent Systems. Springer, Heidelberg (2015)"},{"issue":"1","key":"1_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1017\/S147106840700316X","volume":"8","author":"N-F Zhou","year":"2008","unstructured":"Zhou, N.-F., Sato, T., Shen, Y.-D.: Linear tabling strategies and optimizations. Theory Pract. Logic Program. 8(1), 81\u2013109 (2008)","journal-title":"Theory Pract. Logic Program."}],"container-title":["Lecture Notes in Computer Science","Rule Technologies. Research, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42019-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:13:12Z","timestamp":1498309992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42019-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420189","9783319420196"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42019-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}