{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:46:23Z","timestamp":1794343583907,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540482819","type":"print"},{"value":"9783540482826","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_33","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T14:32:59Z","timestamp":1161095579000},"page":"482-496","source":"Crossref","is-referenced-by-count":2,"title":["Boolean Rings for Intersection-Based Satisfiability"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieh","family":"Hsiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guan-Shieng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daher","family":"Kaiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow \u2014 resolution made simple. Journal of the ACM\u00a048, 149\u2013169 (2001)","journal-title":"Journal of the ACM"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rk, M.: A First Order Extension of St\u00e5lmarck\u2019s Method, Ph.D. thesis, Department of Computer Science and Engineering, G\u00f6teborg University, Sweden (2006)","DOI":"10.1007\/11591191_20"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1145\/1634.1639","volume":"31","author":"P.A. Bloniarz","year":"1984","unstructured":"Bloniarz, P.A., Hunt III, H.B., Rosenkrantz, D.J.: Algebraic structures with hard equivalence and minimization problems. Journal of the ACM\u00a031, 879\u2013904 (1984)","journal-title":"Journal of the ACM"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Bonacina, M.P., Dershowitz, N.: Abstract canonical inference. ACM Transactions on Computational Logic (to appear)","DOI":"10.1145\/1182613.1182619"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\u00a024, 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Groebner basis algorithm to find proofs of unsatisfiability. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 174\u2013183 (1996)","DOI":"10.1145\/237814.237860"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11499107_4","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Dershowitz","year":"2005","unstructured":"Dershowitz, N., Hanna, Z., Nadel, A.: A clause-based heuristic for SAT solvers d heuristic for SAT solvers. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 46\u201360. Springer, Heidelberg (2005)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2006.03.012","volume":"357","author":"N. Dershowitz","year":"2006","unstructured":"Dershowitz, N., Kirchner, C.: Abstract canonical presentations. Theoretical Computer Science\u00a0357, 53\u201369 (2006)","journal-title":"Theoretical Computer Science"},{"key":"33_CR12","first-page":"535","volume-title":"ch. 9","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Plaisted, D.A.: Rewriting. Handbook of Automated Reasoning. In: Robinson, A., Voronkov, A. (eds.) ch. 9, vol.\u00a01, pp. 535\u2013610. Elsevier, Amsterdam (2001)"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming\u00a03, 267\u2013284 (1984)","journal-title":"Journal of Logic Programming"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0036919","volume-title":"Automata, Languages and Programming","author":"J. Hsiang","year":"1983","unstructured":"Hsiang, J., Dershowitz, N.: Rewrite methods for clausal and non-clausal theorem proving. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 331\u2013346. Springer, Heidelberg (1983)"},{"key":"33_CR15","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/dimacs\/035\/16","volume":"35","author":"J. Hsiang","year":"1997","unstructured":"Hsiang, J., Huang, G.S.: Some fundamental properties of Boolean ring normal forms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a035, 587\u2013602 (1997)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"2","key":"33_CR16","first-page":"178","volume":"6","author":"J. Hsiang","year":"1999","unstructured":"Hsiang, J., Huang, G.S.: Compact representation of Boolean formulas. Chinese Journal of Advanced Software Research\u00a06(2), 178\u2013187 (1999)","journal-title":"Chinese Journal of Advanced Software Research"},{"key":"33_CR17","unstructured":"Jan, R.L.: Experimental results on propositional theorem proving with Boolean ring. Master\u2019s thesis, Department of Computer Science and Information Engineering, National Taiwan University (1997)"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/43.310903","volume":"13","author":"W. Kunz","year":"1994","unstructured":"Kunz, W., Pradhan, D.K.: Recursive learning: A new implication technique for efficient solutions to CAD problems \u2014 test, verification, and optimization. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems\u00a013, 1143\u20131158 (1994)","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1005843212881","volume":"19","author":"W. McCune","year":"1997","unstructured":"McCune, W.: Solution of the Robbins problem. Journal of Automated Reasoning\u00a019, 263\u2013276 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P.: Algebraic simplification techniques for propositional satisfiability. Technical Report RT\/01\/2000, INESC (2000)","DOI":"10.1007\/3-540-45349-0_45"},{"key":"33_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-1-4615-3154-8_13","volume-title":"Logic Synthesis and Optimization","author":"T. Sasao","year":"1993","unstructured":"Sasao, T.: And-exor expressions and their optimization. In: Sasao, T. (ed.) Logic Synthesis and Optimization, pp. 287\u2013312. Kluwer, Dordrecht (1993)"},{"issue":"2","key":"33_CR22","first-page":"263","volume":"C-39","author":"T. Sasao","year":"1990","unstructured":"Sasao, T., Besslich, P.: On the complexity of mod-2 sum PLA\u2019s. IEEE Transactions on Computers\u00a0C-39(2), 263\u2013265 (1990)","journal-title":"IEEE Transactions on Computers"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-49519-3_7","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"1998","unstructured":"Sheeran, M., St\u00e5lmarck, G.: A tutorial on st\u00e5lmarck\u2019s proof procedure for propositional logic. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol.\u00a01522, pp. 82\u201399. Springer, Heidelberg (1998)"},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. Journal of the ACM\u00a034, 209\u2013219 (1987)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T11:54:39Z","timestamp":1707306879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11916277_33","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11916277","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}