{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:56:44Z","timestamp":1740095804678,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_21","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"288-302","source":"Crossref","is-referenced-by-count":4,"title":["On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint"],"prefix":"10.1007","author":[{"given":"Jan-Georg","family":"Smaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/774572.774638","volume-title":"Proceedings of the 2002 IEEE\/ACM International Conference on Computer-Aided Design","author":"F.A. Aloul","year":"2002","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: an update. In: Pileggi, L.T., Kuehlmann, A. (eds.) Proceedings of the 2002 IEEE\/ACM International Conference on Computer-Aided Design, pp. 450\u2013457. ACM Press, New York (2002)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190021","volume":"2","author":"O. Bailleux","year":"2006","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 191\u2013200 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-56944-8_40","volume-title":"Logic Programming and Automated Reasoning","author":"P. Barth","year":"1993","unstructured":"Barth, P.: Linear 0-1 inequalities and extended clauses. In: Voronkov, A. (ed.) LPAR 1993. LNCS, vol.\u00a0698, pp. 40\u201351. Springer, Heidelberg (1993)"},{"key":"21_CR4","volume-title":"Proceedings of the 9th Conference on Artificial Intelligence for Applications","author":"P. Barth","year":"1993","unstructured":"Barth, P., Bockmayr, A.: Solving 0-1 problems in CLP(PB). In: Proceedings of the 9th Conference on Artificial Intelligence for Applications, IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1145\/775832.776041","volume-title":"Proceedings of the 40th Design Automation Conference","author":"D. Chai","year":"2003","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Proceedings of the 40th Design Automation Conference, pp. 830\u2013835. ACM Press, New York (2003)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1017\/S0269888900001041","volume":"15","author":"H.E. Dixon","year":"2000","unstructured":"Dixon, H.E., Ginsberg, M.L.: Combining satisfiability techniques from AI and OR. The Knowledge Engineering Review\u00a015, 31\u201345 (2000)","journal-title":"The Knowledge Engineering Review"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-39813-4_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Fr\u00e4nzle","year":"2003","unstructured":"Fr\u00e4nzle, M., Herde, C.: Efficient SAT engines for concise logics: Accelerating proof search for zero-one linear constraint systems. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 302\u2013316. Springer, Heidelberg (2003)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nzle, M., Herde, C.: HySAT: An efficient proof engine for bounded model checking of hybrid systems. In: Formal Methods in System Design, Print version in press (2006), Online version http:\/\/dx.doi.org\/10.1007\/s10703-006-0031-0","DOI":"10.1007\/s10703-006-0031-0"},{"issue":"1-3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"J.N. Hooker","year":"1992","unstructured":"Hooker, J.N.: Generalized resolution for 0-1 linear inequalities. Annals of Mathematics and Artificial Intelligence\u00a06(1-3), 271\u2013286 (1992)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Yan, H.: Tight representations of logical constraints as cardinality rules. Mathematical Programming\u00a085(2), 363\u2013377 (1999)","journal-title":"Mathematical Programming"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2307\/1998052","volume":"213","author":"D. Kleitman","year":"1975","unstructured":"Kleitman, D., Markowsky, G.: On Dedekind\u2019s problem: the number of isotone Boolean functions. II. Transactions of the American Mathematical Society\u00a0213, 373\u2013390 (1975)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques Silva","year":"1999","unstructured":"Marques Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR13","first-page":"530","volume-title":"Proceedings of the 38th Design Automation Conference","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, pp. 530\u2013535. ACM Press, New York (2001)"},{"key":"21_CR14","volume-title":"Neural Networks. A Systematic Introduction","author":"R. Rojas","year":"1996","unstructured":"Rojas, R.: Neural Networks. A Systematic Introduction. Springer, Heidelberg (1996)"},{"key":"21_CR15","volume-title":"Threshold Logic","author":"C.L. Sheng","year":"1969","unstructured":"Sheng, C.L.: Threshold Logic. Academic Press, London (1969)"},{"key":"21_CR16","unstructured":"Neil, J.A.: Sloane. On-line encyclopedia of integer sequences, http:\/\/www.research.att.com\/~njas\/sequences\/Seis.html"},{"key":"21_CR17","unstructured":"Smaus, J.-G.: Representing Boolean functions as linear pseudo-Boolean constraints. In: Hamadi, Y. (ed.) Proceedings of the CP 2006 Workshop on the Integration of SAT and CP techniques (2006)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Smaus, J.-G.: On Boolean functions encodable as a single linear pseudo-Boolean constraint. Technical Report 230, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (2007), Also available as TR No.\u00a013 on http:\/\/www.avacs.org\/","DOI":"10.1007\/978-3-540-72397-4_21"},{"key":"21_CR19","first-page":"472","volume-title":"Encyclopedia of Optimization","author":"V.I. Torvik","year":"2001","unstructured":"Torvik, V.I., Trintaphyllou, E.: Inference of monotone Boolean functions. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 472\u2013480. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"21_CR20","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley & Sons, Chichester (1987)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","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.\u00a01249, pp. 272\u2013275. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T10:14:52Z","timestamp":1629022492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}