{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:22:23Z","timestamp":1767676943857,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T00:00:00Z","timestamp":1523232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Academy of Finland","award":["251170, 276412, 284591, 312662"],"award-info":[{"award-number":["251170, 276412, 284591, 312662"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,4,9]]},"DOI":"10.1145\/3167132.3167230","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:54:10Z","timestamp":1530626050000},"page":"896-902","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A preference-based approach to backbone computation with application to argumentation"],"prefix":"10.1145","author":[{"given":"Alessandro","family":"Previti","sequence":"first","affiliation":[{"name":"University of Helsinki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[{"name":"University of Helsinki"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICCMA 2017 Solver Descriptions. http:\/\/www.dbai.tuwien.ac.at\/iccma17\/files\/pyglaf.pdf.","author":"Alviano Mario","year":"2017","unstructured":"Mario Alviano . 2017 . The pyglaf argumentation reasoner . In ICCMA 2017 Solver Descriptions. http:\/\/www.dbai.tuwien.ac.at\/iccma17\/files\/pyglaf.pdf. Mario Alviano. 2017. The pyglaf argumentation reasoner. In ICCMA 2017 Solver Descriptions. http:\/\/www.dbai.tuwien.ac.at\/iccma17\/files\/pyglaf.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. IJCAI. IJCAI\/AAAI, 696--702","author":"Amaneddine Nouhad","year":"2013","unstructured":"Nouhad Amaneddine , Jean-Fran\u00e7ois Condotta , and Michael Sioutis . 2013 . Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints . In Proc. IJCAI. IJCAI\/AAAI, 696--702 . Nouhad Amaneddine, Jean-Fran\u00e7ois Condotta, and Michael Sioutis. 2013. Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints. In Proc. IJCAI. IJCAI\/AAAI, 696--702."},{"key":"e_1_3_2_1_3_1","volume-title":"Relaxation Search: A Simple Way of Managing Optional Clauses. In Proc","author":"Bacchus Fahiem","year":"2014","unstructured":"Fahiem Bacchus , Jessica Davies , Maria Tsimpoukelli , and George Katsirelos . 2014 . Relaxation Search: A Simple Way of Managing Optional Clauses. In Proc . AAAI. AAAI Press , 835--841. Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, and George Katsirelos. 2014. Relaxation Search: A Simple Way of Managing Optional Clauses. In Proc. AAAI. AAAI Press, 835--841."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.07.011"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32275-7_19"},{"volume-title":"Proc","author":"Castell Thierry","key":"e_1_3_2_1_7_1","unstructured":"Thierry Castell , Claudette Cayrol , Michel Cayrol , and Daniel Le Berre . 1996. Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models . In Proc . ECAI. John Wiley and Sons , 350--354. Thierry Castell, Claudette Cayrol, Michel Cayrol, and Daniel Le Berre. 1996. Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. In Proc. ECAI. John Wiley and Sons, 350--354."},{"volume-title":"Proc","author":"Climer Sharlee","key":"e_1_3_2_1_8_1","unstructured":"Sharlee Climer and Weixiong Zhang . 2002. Searching for Backbones and Fat: A Limit-Crossing Approach with Applications . In Proc . AAAI. AAAI Press , 707--712. Sharlee Climer and Weixiong Zhang. 2002. Searching for Backbones and Fat: A Limit-Crossing Approach with Applications. In Proc. AAAI. AAAI Press, 707--712."},{"volume-title":"Proc. HVC (Lecture Notes in Computer Science)","author":"Codish Michael","key":"e_1_3_2_1_9_1","unstructured":"Michael Codish , Yoav Fekete , and Amit Metodi . 2013. Backbones for Equality . In Proc. HVC (Lecture Notes in Computer Science) , Vol. 8244 . Springer , 1--14. Michael Codish, Yoav Fekete, and Amit Metodi. 2013. Backbones for Equality. In Proc. HVC (Lecture Notes in Computer Science), Vol. 8244. Springer, 1--14."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00164-5"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. IJCAI. Morgan Kaufmann, 248--253","author":"Dubois Olivier","year":"2001","unstructured":"Olivier Dubois and Gilles Dequen . 2001 . A backbone-search heuristic for efficient solving of hard 3-SAT formulae . In Proc. IJCAI. Morgan Kaufmann, 248--253 . Olivier Dubois and Gilles Dequen. 2001. A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In Proc. IJCAI. Morgan Kaufmann, 248--253."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.06.004"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. SAT 2003 (Lecture Notes in Computer Science)","volume":"2919","author":"E\u00e9n Niklas","year":"2004","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . 2004 . An Extensible SAT-solver . In Proc. SAT 2003 (Lecture Notes in Computer Science) , Vol. 2919 . Springer, 502--518. Niklas E\u00e9n and Niklas S\u00f6rensson. 2004. An Extensible SAT-solver. In Proc. SAT 2003 (Lecture Notes in Computer Science), Vol. 2919. Springer, 502--518."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11853886_43"},{"volume-title":"Proc. ECAI (Frontiers in Artificial Intelligence and Applications)","author":"Giunchiglia Enrico","key":"e_1_3_2_1_17_1","unstructured":"Enrico Giunchiglia and Marco Maratea . 2006. Solving Optimization Problems with DLL . In Proc. ECAI (Frontiers in Artificial Intelligence and Applications) , Vol. 141 . IOS Press , 377--381. Enrico Giunchiglia and Marco Maratea. 2006. Solving Optimization Problems with DLL. In Proc. ECAI (Frontiers in Artificial Intelligence and Applications), Vol. 141. IOS Press, 377--381."},{"volume-title":"Proc","author":"Giunchiglia Enrico","key":"e_1_3_2_1_18_1","unstructured":"Enrico Giunchiglia and Marco Maratea . 2007. Planning as Satisfiability with Preferences . In Proc . AAAI. AAAI Press , 987--992. Enrico Giunchiglia and Marco Maratea. 2007. Planning as Satisfiability with Preferences. In Proc. AAAI. AAAI Press, 987--992."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.07.006"},{"volume-title":"Proc. CPAIOR (Lecture Notes in Computer Science)","author":"Hebrard Emmanuel","key":"e_1_3_2_1_20_1","unstructured":"Emmanuel Hebrard , Brahim Hnich , and Toby Walsh . 2004. Super Solutions in Constraint Programming . In Proc. CPAIOR (Lecture Notes in Computer Science) , Vol. 3011 . Springer , 157--172. Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. 2004. Super Solutions in Constraint Programming. In Proc. CPAIOR (Lecture Notes in Computer Science), Vol. 3011. Springer, 157--172."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_52"},{"volume-title":"Proc","author":"Hyttinen Antti","key":"e_1_3_2_1_22_1","unstructured":"Antti Hyttinen , Patrik Hoyer , Frederick Eberhardt , and Matti J\u00e4rvisalo . 2013. Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure . In Proc . UAI. AUAI Press , 301--310. Antti Hyttinen, Patrik Hoyer, Frederick Eberhardt, and Matti J\u00e4rvisalo. 2013. Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure. In Proc. UAI. AUAI Press, 301--310."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2733572.2733574"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9062-z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v33i1.2395"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.006"},{"volume-title":"Proc","author":"Kilby Philip","key":"e_1_3_2_1_28_1","unstructured":"Philip Kilby , John K. Slaney , Sylvie Thi\u00e9baux , and Toby Walsh . 2005. Backbones and Backdoors in Satisfiability . In Proc . AAAI. AAAI Press , 1368--1373. Philip Kilby, John K. Slaney, Sylvie Thi\u00e9baux, and Toby Walsh. 2005. Backbones and Backdoors in Satisfiability. In Proc. AAAI. AAAI Press, 1368--1373."},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. IJCAI. Professional Book Center, 175--180","author":"Kilby Philip","year":"2005","unstructured":"Philip Kilby , John K. Slaney , and Toby Walsh . 2005 . The Backbone of the Travelling Salesperson . In Proc. IJCAI. Professional Book Center, 175--180 . Philip Kilby, John K. Slaney, and Toby Walsh. 2005. The Backbone of the Travelling Salesperson. In Proc. IJCAI. Professional Book Center, 175--180."},{"volume-title":"Proc. ECAI (Frontiers in Artificial Intelligence and Applications)","author":"Marques-Silva Jo\u00e3o","key":"e_1_3_2_1_30_1","unstructured":"Jo\u00e3o Marques-Silva , Mikol\u00e1s Janota , and In\u00eas Lynce . 2010. On Computing Backbones of Propositional Theories . In Proc. ECAI (Frontiers in Artificial Intelligence and Applications) , Vol. 215 . IOS Press , 15--20. Jo\u00e3o Marques-Silva, Mikol\u00e1s Janota, and In\u00eas Lynce. 2010. On Computing Backbones of Propositional Theories. In Proc. ECAI (Frontiers in Artificial Intelligence and Applications), Vol. 215. IOS Press, 15--20."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11504894_94"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/22055"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4%3C414::AID-RSA10%3E3.0.CO;2-G"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"volume-title":"Proc. ICLP (Lecture Notes in Computer Science)","author":"Nieuwenborgh Davy Van","key":"e_1_3_2_1_36_1","unstructured":"Davy Van Nieuwenborgh , Stijn Heymans , and Dirk Vermeir . 2004. On Programs with Linearly Ordered Multiple Preferences . In Proc. ICLP (Lecture Notes in Computer Science) , Vol. 3132 . Springer , 180--194. Davy Van Nieuwenborgh, Stijn Heymans, and Dirk Vermeir. 2004. On Programs with Linearly Ordered Multiple Preferences. In Proc. ICLP (Lecture Notes in Computer Science), Vol. 3132. Springer, 180--194."},{"key":"e_1_3_2_1_37_1","volume-title":"Johannes Peter Wallner, and Matti J\u00e4rvisalo","author":"Niskanen Andreas","year":"2016","unstructured":"Andreas Niskanen , Johannes Peter Wallner, and Matti J\u00e4rvisalo . 2016 . Pakota : A System for Enforcement in Abstract Argumentation. In Proc. JELIA (Lecture Notes in Computer Science), Vol. 10021 . Springer , 385--400. Andreas Niskanen, Johannes Peter Wallner, and Matti J\u00e4rvisalo. 2016. Pakota: A System for Enforcement in Abstract Argumentation. In Proc. JELIA (Lecture Notes in Computer Science), Vol. 10021. Springer, 385--400."},{"volume-title":"Proc","author":"Parkes Andrew J.","key":"e_1_3_2_1_38_1","unstructured":"Andrew J. Parkes . 1997. Clustering at the Phase Transition . In Proc . AAAI\/IAAI. AAAI Press , 340--345. Andrew J. Parkes. 1997. Clustering at the Phase Transition. In Proc. AAAI\/IAAI. AAAI Press, 340--345."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00161"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_50"},{"volume-title":"Proc. ECAI (Frontiers in Artificial Intelligence and Applications)","author":"Rosa Emanuele Di","key":"e_1_3_2_1_41_1","unstructured":"Emanuele Di Rosa , Enrico Giunchiglia , and Marco Maratea . 2008. A new Approach for Solving Satisfiability Problems with Qualitative Preferences . In Proc. ECAI (Frontiers in Artificial Intelligence and Applications) , Vol. 178 . IOS Press , 510--514. Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea. 2008. A new Approach for Solving Satisfiability Problems with Qualitative Preferences. In Proc. ECAI (Frontiers in Artificial Intelligence and Applications), Vol. 178. IOS Press, 510--514."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9095-y"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00054-0"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(96)00062-8"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622248.1622257"},{"key":"e_1_3_2_1_46_1","volume-title":"Slaney and Toby Walsh","author":"John","year":"2001","unstructured":"John K. Slaney and Toby Walsh . 2001 . Backbones in Optimization and Approximation. In Proc. IJCAI. Morgan Kaufmann , 254--259. John K. Slaney and Toby Walsh. 2001. Backbones in Optimization and Approximation. In Proc. IJCAI. Morgan Kaufmann, 254--259."},{"volume-title":"Automation of Reasoning 2: Classical Papers on Computational Logic 1967--1970","author":"Tseitin Grigori S.","key":"e_1_3_2_1_47_1","unstructured":"Grigori S. Tseitin . 1983. On the Complexity of Derivation in Propositional Calculus . In Automation of Reasoning 2: Classical Papers on Computational Logic 1967--1970 , J. Siekmann and G. Wrightson (Eds.). Springer , 466--483. Grigori S. Tseitin. 1983. On the Complexity of Derivation in Propositional Calculus. In Automation of Reasoning 2: Classical Papers on Computational Logic 1967--1970, J. Siekmann and G. Wrightson (Eds.). Springer, 466--483."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40624-9_9"},{"volume-title":"Proc. CP (Lecture Notes in Computer Science)","author":"Zhang Weixiong","key":"e_1_3_2_1_49_1","unstructured":"Weixiong Zhang . 2001. Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT . In Proc. CP (Lecture Notes in Computer Science) , Vol. 2239 . Springer , 153--167. Weixiong Zhang. 2001. Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. In Proc. CP (Lecture Notes in Computer Science), Vol. 2239. Springer, 153--167."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622467.1622481"},{"key":"e_1_3_2_1_52_1","volume-title":"Proc. IJCAI. Professional Book Center, 343--350","author":"Zhang Weixiong","year":"2005","unstructured":"Weixiong Zhang and Moshe Looks . 2005 . A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones . In Proc. IJCAI. Professional Book Center, 343--350 . Weixiong Zhang and Moshe Looks. 2005. A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones. In Proc. IJCAI. Professional Book Center, 343--350."},{"key":"e_1_3_2_1_53_1","volume-title":"Proc. IJCAI. Morgan Kaufmann, 1179--1186","author":"Zhang Weixiong","year":"2003","unstructured":"Weixiong Zhang , Ananda Rangan , and Moshe Looks . 2003 . Backbone Guided Local Search for Maximum Satisfiability . In Proc. IJCAI. Morgan Kaufmann, 1179--1186 . Weixiong Zhang, Ananda Rangan, and Moshe Looks. 2003. Backbone Guided Local Search for Maximum Satisfiability. In Proc. IJCAI. Morgan Kaufmann, 1179--1186."},{"key":"e_1_3_2_1_54_1","volume-title":"Proc. FMCAD. FMCAD Inc., 63--66","author":"Zhu Charlie Shucheng","year":"2011","unstructured":"Charlie Shucheng Zhu , Georg Weissenbacher , and Sharad Malik . 2011 . Postsilicon fault localisation using maximum satisfiability and backbones . In Proc. FMCAD. FMCAD Inc., 63--66 . Charlie Shucheng Zhu, Georg Weissenbacher, and Sharad Malik. 2011. Postsilicon fault localisation using maximum satisfiability and backbones. In Proc. FMCAD. FMCAD Inc., 63--66."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2691365.2691434"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2011.6113981"}],"event":{"name":"SAC 2018: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Pau France","acronym":"SAC 2018"},"container-title":["Proceedings of the 33rd Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167132.3167230","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3167132.3167230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:05Z","timestamp":1750213565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167132.3167230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,9]]},"references-count":55,"alternative-id":["10.1145\/3167132.3167230","10.1145\/3167132"],"URL":"https:\/\/doi.org\/10.1145\/3167132.3167230","relation":{},"subject":[],"published":{"date-parts":[[2018,4,9]]},"assertion":[{"value":"2018-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}