{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:34Z","timestamp":1725558634846},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_16","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:49:20Z","timestamp":1277700560000},"page":"188-201","source":"Crossref","is-referenced-by-count":0,"title":["On Clausal Equivalence and Hull Inclusion"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters\u00a08(3) (1979)","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"16_CR2","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 2nd edn. John Wiley, New York (1993)","edition":"2"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H. Kleine Buning","year":"1995","unstructured":"Kleine Buning, H., Karpinski, M., Flogel, A.: Resolution for quantified Boolean formulas. Information and Computation\u00a0117, 12\u201318 (1995)","journal-title":"Information and Computation"},{"key":"16_CR4","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley&Sons, New York (1999)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/SFCS.1991.185365","volume-title":"Proceedings: 32nd annual Symposium on Foundations of Computer Science","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: IEEE (ed.) Proceedings: 32nd annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1\u20134, pp. 163\u2013169. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"16_CR6","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"16_CR7","volume-title":"Probability Models","author":"S.M. Ross","year":"2000","unstructured":"Ross, S.M.: Probability Models, 7th edn. Academic Press, Inc., London (2000)","edition":"7"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York (1978)"},{"key":"16_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45470-5_21","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"K. Subramani","year":"2002","unstructured":"Subramani, K.: On identifying simple and quantified lattice points in the 2sat polytope. In: Calmet, J., Benhamou, B., Caprotti, O., H\u00e9nocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol.\u00a02385, pp. 217\u2013230. Springer, Heidelberg (2002)"},{"key":"16_CR10","first-page":"29","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"P.M. Vaidya","year":"1987","unstructured":"Vaidya, P.M.: An algorithm for linear programming which requires O(((m+n)n2+ (m+n)1.5n)L)arithmetic operations. In: Aho, A. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 29\u201338. ACM Press, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:43:55Z","timestamp":1552621435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}