{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:59Z","timestamp":1746115859061,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030760"},{"type":"electronic","value":"9783319030777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03077-7_1","type":"book-chapter","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T01:40:21Z","timestamp":1382924421000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Backbones for Equality"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Metodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Codish, M., Miller, A., Prosser, P., Stuckey, P.J.: Breaking symmetries in graph representation. In: Rossi, F. (ed.) IJCAI. IJCAI\/AAAI (2013)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1002\/jgt.3190170511","volume":"17","author":"D.K. Garnick","year":"1993","unstructured":"Garnick, D.K., Kwong, Y.H.H., Lazebnik, F.: Extremal graphs without three-cycles or four-cycles. Journal of Graph Theory\u00a017(5), 633\u2013645 (1993)","journal-title":"Journal of Graph Theory"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-21581-0_17","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"M.J.H. Heule","year":"2011","unstructured":"Heule, M.J.H., J\u00e4rvisalo, M., Biere, A.: Efficient CNF simplification based on binary implication graphs. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 201\u2013215. Springer, Heidelberg (2011)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11527695_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Heule","year":"2005","unstructured":"Heule, M., van Maaren, H.: Aligning CNF- and equivalence-reasoning. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 145\u2013156. Springer, Heidelberg (2005)"},{"key":"1_CR6","unstructured":"Janota, M.: SAT Solving in Interactive Configuration. PhD thesis, University College Dublin (November 2010)"},{"key":"1_CR7","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 1368\u20131373. AAAI Press \/ The MIT Press (2005)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","volume":"46","author":"S. Kirkpatrick","year":"1985","unstructured":"Kirkpatrick, S., Toulouse, G.: Configuration space analysis of traveling salesman problems. J. Phys. (France)\u00a046, 1277\u20131292 (1985)","journal-title":"J. Phys. (France)"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(02)00407-9","volume":"130","author":"C.-M. Li","year":"2003","unstructured":"Li, C.-M.: Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics\u00a0130(2), 251\u2013276 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR10","unstructured":"Manolios, P., Papavasileiou, V.: Pseudo-boolean solving by incremental translation to SAT. In: Bjesse, P., Slobodov\u00e1, A. (eds.) FMCAD, pp. 41\u201345. FMCAD Inc. (2011)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-31612-8_34","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"N. Manthey","year":"2012","unstructured":"Manthey, N.: Coprocessor 2.0 - a flexible CNF simplifier - (tool presentation). In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 436\u2013441. Springer, Heidelberg (2012)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Janota, M., Lynce, I.: On computing backbones of propositional theories. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0215, pp. 15\u201320. IOS Press (2010), Extended version: http:\/\/sat.inesc-id.pt\/~mikolas\/bb-aicom-preprint.pdf","DOI":"10.3233\/978-1-60750-606-5-15"},{"issue":"4-5","key":"1_CR13","first-page":"465","volume":"12","author":"A. Metodi","year":"2012","unstructured":"Metodi, A., Codish, M.: Compiling finite domain constraints to SAT with BEE. TPLP\u00a012(4-5), 465\u2013483 (2012)","journal-title":"TPLP"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-23786-7_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A. Metodi","year":"2011","unstructured":"Metodi, A., Codish, M., Lagoon, V., Stuckey, P.J.: Boolean equi-propagation for optimized SAT encoding. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 621\u2013636. Springer, Heidelberg (2011)"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1613\/jair.3809","volume":"46","author":"A. Metodi","year":"2013","unstructured":"Metodi, A., Codish, M., Stuckey, P.J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems. J. Artif. Intell. Res. (JAIR)\u00a046, 303\u2013341 (2013)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1998","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity for characteristic phase transitions. Nature\u00a0400, 133\u2013137 (1998)","journal-title":"Nature"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Schneider, J.J.: Searching for backbones \u2013 an efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Commun. (1996)","DOI":"10.1016\/0010-4655(96)00062-8"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1008725524946","volume":"16","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., St\u00e5lmarck, G.: A tutorial on st\u00e5lmarck\u2019s proof procedure for propositional logic. Formal Methods in System Design\u00a016(1), 23\u201358 (2000)","journal-title":"Formal Methods in System Design"},{"key":"1_CR19","unstructured":"St\u00e5lmark, G.: A system for determining propositional logic theorem by applying values and rules to triplets that are generated from a formula. US Patent 5,276,897; Canadian Patent 2,018,828; European Patent 0403 545; Swedish Patent 467 076 (1994)"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W. Zhang","year":"2004","unstructured":"Zhang, W.: Phase transitions and backbones of the asymmetric traveling salesman problem. J. Artif. Intell. Res. (JAIR)\u00a021, 471\u2013497 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03077-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T18:28:53Z","timestamp":1746037733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03077-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030760","9783319030777"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03077-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}