{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:36:44Z","timestamp":1742967404399,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319296036"},{"type":"electronic","value":"9783319296043"}],"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-29604-3_4","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T07:53:12Z","timestamp":1455954792000},"page":"45-61","source":"Crossref","is-referenced-by-count":5,"title":["The Boolean Constraint Solver of SWI-Prolog (System Description)"],"prefix":"10.1007","author":[{"given":"Markus","family":"Triska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"key":"4_CR1","unstructured":"Benhamou, F., Toura\u00efvane, T.: Prolog IV: langage et algorithmes. In: JFPLC, pp. 51\u201364 (1995)"},{"issue":"8","key":"4_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR3","unstructured":"Burckel, S., Hoarau, S., Mesnard, F., Neumerkel, U.: cTI: Bottom-up termination inference for logic programs. In: 15. WLP, pp. 123\u2013134 (2000)"},{"key":"4_CR4","unstructured":"Carlsson, M.: Boolean Constraints in SICStus Prolog. SICS TR, T91, 09 (1991)"},{"issue":"1","key":"4_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00247670","volume":"17","author":"P Codognet","year":"1996","unstructured":"Codognet, P., Diaz, D.: A simple and efficient boolean solver for constraint logic programming. J. Autom. Reason. 17(1), 97\u2013129 (1996)","journal-title":"J. Autom. Reason."},{"key":"4_CR6","unstructured":"Colin, S., Mesnard, F., Rauzy, A.: Un module Prolog de mu-calcul bool\u00e9en: une r\u00e9alisation par BDD. In: JFPLC 1999, Huiti\u00e8mes Journ\u00e9es Francophones de Programmation Logique et Programmation par Contraintes, pp. 23\u201338 (1999)"},{"key":"4_CR7","unstructured":"Demoen, B.: Dynamic attributes, their hProlog implementation, and a first evaluation. Report CW 350, Department of Computer Science, K.U. Leuven, October 2002"},{"issue":"1\u20132","key":"4_CR8","first-page":"253","volume":"12","author":"D Diaz","year":"2012","unstructured":"Diaz, D., Abreu, S., Codognet, P.: On the implementation of GNU Prolog. TPLP 12(1\u20132), 253\u2013282 (2012)","journal-title":"TPLP"},{"key":"4_CR9","unstructured":"Dincbas, M., Hentenryck, P.V., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The constraint logic programming language CHIP. In: FGCS, pp. 693\u2013702 (1988)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10601-015-9201-2","volume":"21","author":"J. N. Hooker","year":"2015","unstructured":"Hooker, J.N.: Projection, consistency, and George Boole. Constraints 21(1), 59\u201376 (2016). \n                    http:\/\/dx.doi.org\/10.1007\/s10601-015-9201-2","journal-title":"Constraints"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.L.: Constraint logic programming. In: POPL, pp.111\u2013119 (1987)","DOI":"10.1145\/41625.41635"},{"key":"4_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, 12th edn. Addison-Wesley Professional, Reading, Massachusetts (2009)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-15675-5_23","volume-title":"Logics in Artificial Intelligence","author":"T Mantadelis","year":"2010","unstructured":"Mantadelis, T., Rocha, R., Kimmig, A., Janssens, G.: Preprocessing boolean formulae for BDDs in a probabilistic context. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 260\u2013272. Springer, Heidelberg (2010)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45349-0_45","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"J Marques-Silva","year":"2000","unstructured":"Marques-Silva, J.: Algebraic Simplification Techniques for Propositional Satisfiability. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, p. 537. Springer, Heidelberg (2000)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Design Automation Conference (DAC), pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"4_CR16","unstructured":"Neumerkel, U.: Teaching Prolog and CLP (tutorial). In: ICLP (1997)"},{"key":"4_CR17","unstructured":"Neumerkel, U., Kral, S.: Declarative program development in Prolog with GUPU. In: Proceedings of the 12th International Workshop on Logic Programming Environments, WLPE, pp. 77\u201386 (2002)"},{"key":"4_CR18","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Second DIMACS Implementation Challenge (1993)"},{"key":"4_CR19","unstructured":"Tarau, P.: Pairing functions, boolean evaluation and binary decision diagrams. CoRR abs\/0808.0555 (2008). \n                    arxiv.org\/abs\/0808.0555"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Tarau, P., Luderman, B.: Boolean evaluation with a pairing and unpairing function. In: SYNASC 2012, pp. 384\u2013390 (2012)","DOI":"10.1109\/SYNASC.2012.20"},{"issue":"1\u20132","key":"4_CR21","first-page":"67","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. TPLP 12(1\u20132), 67\u201396 (2012)","journal-title":"TPLP"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030077","volume-title":"Automated Deduction - CADE-14","author":"H Zhang","year":"1997","unstructured":"Zhang, H.: SATO: an efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29604-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:19:35Z","timestamp":1559387975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29604-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319296036","9783319296043"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29604-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}