{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:42:17Z","timestamp":1761324137746,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/tase.2017.8285627","type":"proceedings-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T17:54:03Z","timestamp":1518458043000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing backbone filtering"],"prefix":"10.1109","author":[{"given":"Yueling","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geguang","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability","author":"berg","year":"2015","journal-title":"Artificial Intelligence"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.3233\/AIC-140640","article-title":"Algorithms for computing backbones of propositional formulae","volume":"28","author":"janota","year":"2015","journal-title":"AI communications"},{"journal-title":"SAT Solving in Interactive Configuration","year":"2010","author":"janota","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_19"},{"key":"ref14","first-page":"507","volume":"2","author":"surynek","year":"2012","journal-title":"Application of propositional satisfiability to special cases of cooperative path-planning"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.08.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.001"},{"key":"ref17","first-page":"342","article-title":"Two linear distinguishing attacks on vmpc and rc4a and weakness of rc4 family of stream ciphers","author":"alsed","year":"2005","journal-title":"13th International Conference on Fast Software Encryption"},{"journal-title":"Detecting inadmissible and necessary variables in large propositional formulae","year":"2001","author":"kaiser","key":"ref18"},{"key":"ref19","first-page":"248","article-title":"A backbone-search heuristic for efficient solving of hard 3-sat formulae","volume":"1","author":"dubois","year":"2001","journal-title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01)"},{"journal-title":"Solving Constraint Satisfaction Problems through Belief Propagation-guided Decimation","year":"2007","author":"montanari","key":"ref4"},{"key":"ref3","first-page":"1179","article-title":"Backbone guided local search for maximum satisfiability","author":"zhang","year":"2003","journal-title":"Proceedings of the Nighteenth International Joint Conference on Artificial Intelligence (IJCAI-03)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2011.6113981"},{"key":"ref5","first-page":"343","article-title":"A novel local search algorithm for the traveling salesman problem that exploits backbones","author":"zhang","year":"2005","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-05)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_24"},{"key":"ref7","first-page":"63","article-title":"Post-silicon fault localisation using maximum satisfiability and backbones","author":"zhu","year":"2011","journal-title":"International Conference on Formal Methods In Computer-Aided Design"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/25"},{"key":"ref1","first-page":"1368","article-title":"Backbones and backdoors in satisfiability","volume":"5","author":"kilby","year":"2005","journal-title":"Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00164-5"},{"key":"ref20","first-page":"707","article-title":"Searching for backbones and fat: A limit-crossing approach with applications","author":"climer","year":"2002","journal-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02)\/Proceedings of the Fourteenth Innovative Applications of Artificial Intelligence Conference on Artificial Intelligence (IAAI-02)"},{"key":"ref22","first-page":"15","article-title":"Experimental analysis of backbone computation algorithms","author":"janota","year":"2012","journal-title":"RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion"},{"key":"ref21","first-page":"15","article-title":"On computing backbones of propositional theories","volume":"215","author":"marques-silva","year":"2010","journal-title":"Proceedings of European Association for Artificial Intelligence (ECAI)"}],"event":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","start":{"date-parts":[[2017,9,13]]},"location":"Sophia Antipolis","end":{"date-parts":[[2017,9,15]]}},"container-title":["2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8277122\/8285614\/08285627.pdf?arnumber=8285627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T02:25:03Z","timestamp":1660443903000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8285627\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/tase.2017.8285627","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}