{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:56:03Z","timestamp":1743026163894,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878261"},{"type":"electronic","value":"9783540878278"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_29","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"334-348","source":"Crossref","is-referenced-by-count":6,"title":["On the Computation of Elimination Ideals of Boolean Polynomial Rings"],"prefix":"10.1007","author":[{"given":"Yosuke","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Nagai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shutaro","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Buchberger, B.: Ein Algorithms zum Auffinden der Basiselemente des Restklassenrings bach einem nulldimensionalen Polynomial. Doctoral Dissertation Math. Inst. University of Innsbruck, Austria (1965)"},{"key":"29_CR2","first-page":"217","volume-title":"Principles and Practices of Constraint Programming","author":"D. Kapur","year":"1995","unstructured":"Kapur, D.: An Approach for Solving Systems of Parametric Polynomial Equations. In: Saraswat, Van Hentenryck (eds.) Principles and Practices of Constraint Programming, pp. 217\u2013244. MIT Press, Cambridge (1995)"},{"key":"29_CR3","first-page":"253","volume-title":"A Study on Boolean Constraint Solvers. Constraint Logic Programming Selected Research","author":"S. Menju","year":"1993","unstructured":"Menju, S., Sakai, K., Sato, Y., Aiba, A.: A Study on Boolean Constraint Solvers. Constraint Logic Programming Selected Research, pp. 253\u2013267. MIT Press, Cambridge (1993)"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jsco.2001.0504","volume":"33","author":"A. Montes","year":"2002","unstructured":"Montes, A.: A new algorithm for discussing Gr\u00f6bner bases with parameters. J. Symb. Comp.\u00a033(2), 183\u2013208 (2002)","journal-title":"J. Symb. Comp."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.jsc.2005.09.013","volume":"41","author":"M. Manubens","year":"2006","unstructured":"Manubens, M., Montes, A.: Improving DISPGB algorithm using the discriminant ideal. J. Symb. Comp.\u00a041, 1245\u20131263 (2006)","journal-title":"J. Symb. Comp."},{"key":"29_CR6","unstructured":"Rudeanu, S.: Boolean functions and equations. North-Holland Publishing Co., Amsterdam. American Elsevier Publishing Co., Inc., New York (1974)"},{"key":"29_CR7","unstructured":"Sato, Y., Inoue, S.: On the Construction of Comprehensive Boolean Gr\u00f6bner Bases. In: Proceedings of the Seventh Asian Symposium on Computer Mathematics (ASCM 2005), pp. 145\u2013148 (2005)"},{"key":"29_CR8","unstructured":"Sakai, K., Sato, Y.: Boolean Gr\u00f6bner bases. ICOT Technical Momorandum 488 (1988), \n                      http:\/\/www.icot.or.jp\/ARCHIVE\/Museum\/TRTM\/tm-list-E.html"},{"key":"29_CR9","unstructured":"Sakai, K., Sato, Y., Menju, S.: Boolean Gr\u00f6bner bases (revised). ICOT Technical Report 613 (1991), \n                      http:\/\/www.icot.or.jp\/ARCHIVE\/Museum\/TRTM\/tr-list-E.html"},{"key":"29_CR10","unstructured":"Sato, Y., et al.: Set Constrains Solvers (Prolog version) (1996), \n                      http:\/\/www.icot.or.jp\/ARCHIVE\/Museum\/FUNDING\/funding-96-E.html"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/281508.281658","volume-title":"Proceedings of ISSAC 1998","author":"Y. Sato","year":"1998","unstructured":"Sato, Y.: A new type of canonical Gr\u00f6bner bases in polynomial rings over Von Neumann regular rings. In: Proceedings of ISSAC 1998, pp. 317\u2013332. ACM Press, New York (1998)"},{"key":"29_CR12","unstructured":"Sato, Y., et al.: Set Constrains Solvers (Klic version) (1998), \n                      http:\/\/www.icot.or.jp\/ARCHIVE\/Museum\/FUNDING\/funding-98-E.html"},{"issue":"3-4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0747-7171(03)00098-1","volume":"36","author":"A. Suzuki","year":"2003","unstructured":"Suzuki, A., Sato, Y.: An Alternative approach to Comprehensive Gr\u00f6bner Bases. J. Symb. Comp.\u00a036(3-4), 649\u2013667 (2003)","journal-title":"J. Symb. Comp."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Suzuki, A., Sato, Y.: A Simple Algorithm to Compute Comprehensive Gr\u00f6bner Bases Using Gr\u00f6bner Bases. In: International Symposium on Symbolic and Algebraic Computation (ISSAC 2006), Proceedings, pp. 326\u2013331 (2006)","DOI":"10.1145\/1145768.1145821"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-51517-8_137","volume-title":"EUROCAL \u201987","author":"V. Weispfenning","year":"1989","unstructured":"Weispfenning, V.: Gr\u00f6bner bases in polynomial ideals over commutative regular rings. In: Davenport, J.H. (ed.) ISSAC 1987 and EUROCAL 1987. LNCS, vol.\u00a0378, pp. 336\u2013347. Springer, Heidelberg (1989)"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0747-7171(92)90023-W","volume":"14","author":"V. Weispfenning","year":"1992","unstructured":"Weispfenning, V.: Comprehensive Gr\u00f6bner bases. J. Symb. Comp.\u00a014(1), 1\u201329 (1992)","journal-title":"J. Symb. Comp."}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:13:53Z","timestamp":1715238833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}