{"type":"ScholarlyArticle","title":"Proofs and Certificates for Max-SAT (Extended Abstract)","authors":[{"name":"Matthieu Py","slug":"matthieu-py","given":"Matthieu","family":"Py","affiliation":"Aix-Marseille Université , Université de Toulon , CNRS , LIS , Marseille , France; Université Clermont Auvergne , Mines Saint-Etienne , CNRS , LIMOS , F-63000 Clermont-Ferrand , France"},{"name":"Mohamed Sami Cherif","slug":"mohamed-sami-cherif","given":"Mohamed Sami","family":"Cherif","affiliation":"Aix-Marseille Université , Université de Toulon , CNRS , LIS , Marseille , France"},{"name":"Djamal Habet","slug":"djamal-habet","given":"Djamal","family":"Habet","affiliation":"Aix-Marseille Université , Université de Toulon , CNRS , LIS , Marseille , France"}],"abstract":"In this paper, we present a tool, called MS-Builder, which generates certificates for the Max-SAT problem in the particular form of a sequence of equivalence-preserving transformations. To generate a certificate, MS-Builder iteratively calls a SAT oracle to get a SAT resolution refutation which is handled and adapted into a sound refutation for Max-SAT. In particular, the size of the computed Max-SAT refutation is linear with respect to the size of the initial refutation if it is semi-read-once, tree-like regular, tree-like or semi-tree-like. Additionally, we propose an extendable tool, called MS-Checker, able to verify the validity of any Max-SAT certificate using Max-SAT inference rules.","doi":"10.24963/ijcai.2023/787","url":"https://ijcai.org/proceedings/2023/787","pdf":"https://ijcai.org/proceedings/2023/0787.pdf","markdown":"https://ijcai.org/proceedings/2023/787.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/787","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Journal Track","track":"Journal Track","number":787,"pages":{"first":6942,"last":6947},"keywords":["Constraint Satisfaction and Optimization: CSO: Satisfiabilty","Constraint Satisfaction and Optimization: CSO: Solvers and tools"],"videos":[],"references":[{"position":1,"raw":"[Abramé and Habet, 2014] André Abramé and Djamal Habet. Ah- maxsat: Description and Evaluation of a Branch and Bound Max- SAT Solver. J. Satisf. Boolean Model. Comput., 9(1):89-128, 2014.","title":"Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver","authors":"Habet Abramé, André Abramé, Djamal Habet","year":"2014","venue":"J. Satisf. Boolean Model. Comput","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Achá and Nieuwenhuis, 2014] Roberto Javier Asín Achá and Robert Nieuwenhuis. Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res., 218(1):71-91, 2014.","title":"Curriculum-based course timetabling with SAT and MaxSAT","authors":"Roberto Javier, Asín Achá, Robert Nieuwenhuis","year":"2014","venue":"Ann. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ansótegui et al., 2009] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. Solving (Weighted) Partial MaxSAT through Satisfi- ability Testing. In Oliver Kullmann, editor, Theory and Applica- tions of Satisfiability Testing -SAT 2009, 12th International Con- ference, SAT 2009, Swansea, UK, June 30 -July 3, 2009. Pro- ceedings, volume 5584 of Lecture Notes in Computer Science, pages 427-440. Springer, 2009.","title":"Solving (Weighted) Partial MaxSAT through Satisfiability Testing","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy","year":"2009","venue":"Theory and Applications of Satisfiability Testing -SAT 2009, 12th International Conference, SAT 2009","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ansótegui et al., 2013] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms. Artif. Intell., 196:77-105, 2013.","title":"SAT-based MaxSAT algorithms","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Atserias and Lauria, 2019] Albert Atserias and Massimo Lauria. Circular (yet sound) proofs. In Mikolás Janota and Inês Lynce, editors, Theory and Applications of Satisfiability Testing -SAT 2019 -22nd International Conference, SAT 2019, Lisbon, Por- tugal, July 9-12, 2019, Proceedings, volume 11628 of Lecture Notes in Computer Science, pages 1-18. Springer, 2019.","title":"Albert Atserias and Massimo Lauria. Circular (yet sound) proofs","authors":"Lauria Atserias","year":"2019","venue":"Theory and Applications of Satisfiability Testing -SAT 2019 -22nd International Conference, SAT 2019","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bacchus et al., 2020] Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. MaxSAT Evaluation 2020. https://maxsat-evaluations. github.io/2020/, 2020. Accessed: 2021-07-11.","title":"Fahiem Bacchus, Matti Järvisalo","authors":"Bacchus","year":"2020","venue":null,"doi":null,"url":"https://maxsat-evaluations.github.io/2020/,2020","internal_url":null},{"position":7,"raw":"[Ben-Sasson et al., 2004] Eli Ben-Sasson, Russell Impagliazzo, and Avi Wigderson. Near Optimal Separation Of Tree-Like And General Resolution. Comb., 24(4):585-603, 2004.","title":"Near Optimal Separation Of Tree-Like And General Resolution","authors":"Ben-Sasson","year":"2004","venue":"Comb","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Biere, 2010] Armin Biere. Booleforce. http://fmv.jku.at/ booleforce/, 2010. Accessed: 2020-01-01.","title":"Armin Biere. Booleforce","authors":"Biere","year":"2010","venue":null,"doi":null,"url":"http://fmv.jku.at/booleforce/","internal_url":null},{"position":9,"raw":"[Bofill et al., 2015] Miquel Bofill, Marc Garcia, Josep Suy, and Mateu Villaret. MaxSAT-Based Scheduling of B2B Meetings. In Laurent Michel, editor, Integration of AI and OR Techniques in Constraint Programming -12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings, volume 9075 of Lecture Notes in Computer Science, pages 65- 73. Springer, 2015.","title":"MaxSAT-Based Scheduling of B2B Meetings","authors":"Miquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret","year":"2015","venue":"Integration of AI and OR Techniques in Constraint Programming -12th International Conference, CPAIOR 2015","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bonet and Levy, 2020] Maria Luisa Bonet and Jordi Levy. Equiv- alence Between Systems Stronger Than Resolution. In Luca Pulina and Martina Seidl, editors, Theory and Applications of Satisfiability Testing -SAT 2020 -23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings, volume 12178 of Lecture Notes in Computer Science, pages 166-181. Springer, 2020.","title":"Equivalence Between Systems Stronger Than Resolution","authors":"Maria, Luisa Bonet, Jordi Levy","year":"2020","venue":"Theory and Applications of Satisfiability Testing -SAT 2020 -23rd International Conference","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bonet et al., 2006] Maria Luisa Bonet, Jordi Levy, and Felip Manyà. A Complete Calculus for Max-SAT. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing -SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, volume 4121 of Lecture Notes in Computer Science, pages 240-251. Springer, 2006.","title":"A Complete Calculus for Max-SAT","authors":"Luisa Maria, Jordi Bonet, Felip Levy, Manyà","year":"2006","venue":"Theory and Applications of Satisfiability Testing -SAT 2006, 9th International Conference","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bonet et al., 2007] Maria Luisa Bonet, Jordi Levy, and Felip Manyà. Resolution for Max-SAT. Artif. Intell., 171(8-9):606- 618, 2007.","title":"Resolution for Max-SAT","authors":"Luisa Maria, Jordi Bonet, Felip Levy, Manyà","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Cherif et al., 2020] Mohamed Sami Cherif, Djamal Habet, and André Abramé. Understanding the power of Max-SAT resolu- tion through UP-resilience. Artif. Intell., 289:103397, 2020.","title":"Understanding the power of Max-SAT resolution through UP-resilience","authors":"Mohamed Sami Cherif, Djamal Habet, André Abramé","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cherif et al., 2022] Mohamed Sami Cherif, Djamal Habet, and Matthieu Py. From Crossing-Free Resolution to Max-SAT Res- olution. In Christine Solnon, editor, 28th International Confer- ence on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel, volume 235 of LIPIcs, pages 12:1-12:17. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022.","title":"From Crossing-Free Resolution to Max-SAT Resolution","authors":"Cherif","year":"2022","venue":"28th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[D'Almeida and Grégoire, 2012] Dominique D'Almeida and Éric Grégoire. Model-based diagnosis with default information im- plemented through MAX-SAT technology. In Chengcui Zhang, James Joshi, Elisa Bertino, and Bhavani Thuraisingham, editors, IEEE 13th International Conference on Information Reuse & In- tegration, IRI 2012, Las Vegas, NV, USA, August 8-10, 2012, pages 33-36. IEEE, 2012.","title":"Model-based diagnosis with default information implemented through MAX-SAT technology","authors":"D' Almeida, Grégoire ; Dominique D' Almeida, Éric Grégoire","year":"2012","venue":"IEEE 13th International Conference on Information Reuse & Integration, IRI 2012","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Davies and Bacchus, 2011] Jessica Davies and Fahiem Bacchus. Solving MAXSAT by Solving a Sequence of Simpler SAT In- stances. In Jimmy Ho-Man Lee, editor, Principles and Practice of Constraint Programming -CP 2011 -17th International Con- ference, CP 2011, Perugia, Italy, September 12-16, 2011. Pro- ceedings, volume 6876 of Lecture Notes in Computer Science, pages 225-239. Springer, 2011.","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","authors":"Bacchus Davies, Jessica Davies, Fahiem Bacchus","year":"2011","venue":"Principles and Practice of Constraint Programming -CP 2011 -17th International Conference, CP 2011","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Demirovic and Musliu, 2017] Emir Demirovic and Nysret Mus- liu. MaxSAT-based large neighborhood search for high school timetabling. Comput. Oper. Res., 78:172-180, 2017.","title":"Emir Demirovic and Nysret Musliu. MaxSAT-based large neighborhood search for high school timetabling","authors":"Musliu Demirovic","year":"2017","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Filmus et al., 2020] Yuval Filmus, Meena Mahajan, Gaurav Sood, and Marc Vinyals. MaxSAT Resolution and Subcube Sums. In Luca Pulina and Martina Seidl, editors, Theory and Applications of Satisfiability Testing -SAT 2020 -23rd International Confer- ence, Alghero, Italy, July 3-10, 2020, Proceedings, volume 12178 of Lecture Notes in Computer Science, pages 295-311. Springer, 2020.","title":"MaxSAT Resolution and Subcube Sums","authors":"Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals","year":"2020","venue":"Theory and Applications of Satisfiability Testing -SAT 2020 -23rd International Conference","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Fu and Malik, 2006] Zhaohui Fu and Sharad Malik. On Solving the Partial MAX-SAT Problem. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Test- ing -SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, volume 4121 of Lecture Notes in Computer Science, pages 252-265. Springer, 2006.","title":"On Solving the Partial MAX-SAT Problem","authors":"Zhaohui Fu, Sharad Malik","year":"2006","venue":"Theory and Applications of Satisfiability Testing -SAT 2006, 9th International Conference","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Guerra and Lynce, 2012] João Guerra and Inês Lynce. Reason- ing over Biological Networks Using Maximum Satisfiability. In Michela Milano, editor, Principles and Practice of Constraint Programming -18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings, volume 7514 of Lecture Notes in Computer Science, pages 941-956. Springer, 2012.","title":"João Guerra and Inês Lynce. Reasoning over Biological Networks Using Maximum Satisfiability","authors":"Lynce Guerra","year":"2012","venue":"Principles and Practice of Constraint Programming -18th International Conference, CP 2012","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Heras and Marques-Silva, 2011] Federico Heras and João Marques-Silva. Read-Once Resolution for Unsatisfiability- Based Max-SAT Algorithms. In Toby Walsh, editor, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pages 572-577. IJCAI/AAAI, 2011.","title":"Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms","authors":"Marques-Silva ; Heras, Federico Heras, João Marques-Silva","year":"2011","venue":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/103"},{"position":22,"raw":"[Hertel and Urquhart, 2009] Alexander Hertel and Alasdair Urquhart. Algorithms and Complexity Results for Input and Unit Resolution. J. Satisf. Boolean Model. Comput., 6(1-3):141-164, 2009.","title":"Algorithms and Complexity Results for Input and Unit Resolution","authors":"Urquhart Hertel, Alexander Hertel, Alasdair Urquhart","year":"2009","venue":"J. Satisf. Boolean Model. Comput","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Ignatiev et al., 2019] Alexey Ignatiev, António Morgado, and João Marques-Silva. RC2: an Efficient MaxSAT Solver. J. Satisf. Boolean Model. Comput., 11(1):53-64, 2019.","title":"RC2: an Efficient MaxSAT Solver","authors":"Alexey Ignatiev, António Morgado, João Marques-Silva","year":"2019","venue":"J. Satisf. Boolean Model. Comput","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Iwama and Miyano, 1995] Kazuo Iwama and Eiji Miyano. In- tractability of Read-Once Resolution. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapo- lis, Minnesota, USA, June 19-22, 1995, pages 29-36. IEEE Com- puter Society, 1995.","title":"Intractability of Read-Once Resolution","authors":"Miyano ; ] Kazuo Iwama, Eiji Iwama, Miyano","year":"1995","venue":"Proceedings of the Tenth Annual Structure in Complexity Theory Conference","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Küegel, 2012] Adrian Küegel. Improved Exact Solver for the Weighted MAX-SAT Problem. In POS-10. Pragmatics of SAT, volume 8 of EPiC Series in Computing, pages 15-27. EasyChair, 2012.","title":"Improved Exact Solver for the Weighted MAX-SAT Problem","authors":"Adrian Küegel","year":"2012","venue":"Pragmatics of SAT","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Larrosa and Heras, 2005] Javier Larrosa and Federico Heras. Res- olution in Max-SAT and its relation to local consistency in weighted CSPs. In Leslie Pack Kaelbling and Alessandro Saf- fiotti, editors, IJCAI-05, Proceedings of the Nineteenth Inter- national Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 -August 5, 2005, pages 193-198.","title":"Resolution in Max-SAT and its relation to local consistency in weighted CSPs","authors":"Heras Larrosa, Javier Larrosa, Federico Heras","year":"2005","venue":"IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2005/13"},{"position":27,"raw":"[Larrosa and Rollon, 2020a] Javier Larrosa and Emma Rollon. Augmenting the Power of (Partial) MaxSat Resolution with Ex- tension. In The Thirty-Fourth AAAI Conference on Artificial In- telligence, AAAI 2020, The Thirty-Second Innovative Applica- tions of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelli- gence, EAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1561-1568. AAAI Press, 2020.","title":"Augmenting the Power of (Partial) MaxSat Resolution with Extension","authors":"Rollon Larrosa, Javier Larrosa, Emma Rollon","year":"2020","venue":"The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Larrosa and Rollon, 2020b] Javier Larrosa and Emma Rollon. To- wards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems. In Luca Pulina and Martina Seidl, editors, The- ory and Applications of Satisfiability Testing -SAT 2020 -23rd International Conference, Alghero, Italy, July 3-10, 2020, Pro- ceedings, volume 12178 of Lecture Notes in Computer Science, pages 218-232. Springer, 2020.","title":"Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems","authors":"Rollon Larrosa, Javier Larrosa, Emma Rollon","year":"2020","venue":"Theory and Applications of Satisfiability Testing -SAT 2020 -23rd International Conference","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Larrosa et al., 2008] Javier Larrosa, Federico Heras, and Simon de Givry. A logical approach to efficient Max-SAT solving. Artifi- cial Intelligence, 172(2):204-233, 2008.","title":"A logical approach to efficient Max-SAT solving","authors":"Javier Larrosa, Federico Heras, Simon De, Givry","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Li et al., 2007] Chu Min Li, Felip Manyà, and Jordi Planes. New Inference Rules for Max-SAT. J. Artif. Intell. Res., 30:321-359, 2007.","title":"New Inference Rules for Max-SAT","authors":"Min Chu, Felip Li, Jordi Manyà, Planes","year":"2007","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Li et al., 2016] Chu Min Li, Felip Manyà, and Joan Ramon Soler. A Clause Tableau Calculus for MaxSAT. In Subbarao Kambham- pati, editor, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pages 766-772. IJCAI/AAAI Press, 2016.","title":"A Clause Tableau Calculus for MaxSAT","authors":"Min Chu, Felip Li, Joan Ramon Manyà, Soler","year":"2016","venue":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/114"},{"position":32,"raw":"[Li et al., 2022] Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, and Kun He. Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun., 35(2):131- 151, 2022.","title":"Boosting branch-and-bound MaxSAT solvers with clause learning","authors":"Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He","year":"2022","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Loveland, 1970] D.W. Loveland. A linear format for resolution. In Symposium on Automatic Demonstration, pages 147-162, 1970.","title":"A linear format for resolution","authors":"D W Loveland","year":"1970","venue":"Symposium on Automatic Demonstration","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Manquinho et al., 2009] Vasco M. Manquinho, João P. Marques Silva, and Jordi Planes. Algorithms for Weighted Boolean Opti- mization. In Oliver Kullmann, editor, Theory and Applications of Satisfiability Testing -SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 -July 3, 2009. Proceedings, volume 5584 of Lecture Notes in Computer Science, pages 495- 508. Springer, 2009.","title":"Algorithms for Weighted Boolean Optimization","authors":"M Vasco, Manquinho, P Marques João, Jordi Silva, Planes","year":"2009","venue":"Theory and Applications of Satisfiability Testing -SAT 2009, 12th International Conference, SAT 2009","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Manyà et al., 2020] Felip Manyà, Santiago Negrete, Carme Roig, and Joan Ramon Soler. Solving the Team Composition Problem in a Classroom. Fundam. Informaticae, 174(1):83-101, 2020.","title":"Solving the Team Composition Problem in a Classroom","authors":"Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler","year":"2020","venue":"Fundam. Informaticae","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Martins et al., 2014] Ruben Martins, Vasco M. Manquinho, and Inês Lynce. Open-WBO: A Modular MaxSAT Solver. In Carsten Sinz and Uwe Egly, editors, Theory and Applications of Satisfia- bility Testing -SAT 2014 -17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, volume 8561 of Lecture Notes in Computer Science, pages 438-445. Springer, 2014.","title":"Open-WBO: A Modular MaxSAT Solver","authors":"Ruben Martins, M Vasco, Inês Manquinho, Lynce","year":"2014","venue":"Theory and Applications of Satisfiability Testing -SAT 2014 -17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Muise et al., 2016] Christian J. Muise, J. Christopher Beck, and Sheila A. McIlraith. Optimal Partial-Order Plan Relaxation via MaxSAT. J. Artif. Intell. Res., 57:113-149, 2016.","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","authors":"Muise","year":"2016","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Narodytska and Bacchus, 2014] Nina Narodytska and Fahiem Bacchus. Maximum Satisfiability Using Core-Guided MaxSAT Resolution. In Carla E. Brodley and Peter Stone, editors, Pro- ceedings of the Twenty-Eighth AAAI Conference on Artificial In- telligence, July 27 -31, 2014, Québec City, Québec, Canada, pages 2717-2723. AAAI Press, 2014.","title":"Nina Narodytska and Fahiem Bacchus. Maximum Satisfiability Using Core-Guided MaxSAT Resolution","authors":"Bacchus Narodytska","year":"2014","venue":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Py et al., 2020] Matthieu Py, Mohamed Sami Cherif, and Djamal Habet. Towards Bridging the Gap Between SAT and Max-SAT Refutations. In 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 137-144. IEEE, 2020.","title":"Towards Bridging the Gap Between SAT and Max-SAT Refutations","authors":"Matthieu Py, Mohamed Sami Cherif, Djamal Habet","year":"2020","venue":"32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Py et al., 2021a] Matthieu Py, Mohamed Sami Cherif, and Djamal Habet. A Proof Builder for Max-SAT. In Chu-Min Li and Felip Manyà, editors, Theory and Applications of Satisfiability Testing -SAT 2021 -24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, volume 12831 of Lecture Notes in Computer Science, pages 488-498. Springer, 2021.","title":"A Proof Builder for Max-SAT","authors":"Py","year":"2021","venue":"Theory and Applications of Satisfiability Testing -SAT 2021 -24th International Conference","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Py et al., 2021b] Matthieu Py, Mohamed Sami Cherif, and Djamal Habet. Computing Max-SAT Refutations using SAT Oracles. In 33rd IEEE International Conference on Tools with Artificial In- telligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021, pages 404-411. IEEE, 2021.","title":"Computing Max-SAT Refutations using SAT Oracles","authors":"Py","year":"2021","venue":"33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Py et al., 2021c] Matthieu Py, Mohamed Sami Cherif, and Djamal Habet. Inferring Clauses and Formulas in Max-SAT. In 33rd IEEE International Conference on Tools with Artificial Intelli- gence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021, pages 632-639. IEEE, 2021.","title":"Inferring Clauses and Formulas in Max-SAT","authors":"Py","year":"2021","venue":"33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Py et al., 2022] Matthieu Py, Mohamed Sami Cherif, and Djamal Habet. Proofs and certificates for max-sat. Journal of Artificial Intelligence Research, 75:1373-1400, 2022.","title":"Proofs and certificates for max-sat","authors":"Matthieu Py, Mohamed Sami Cherif, Djamal Habet","year":"2022","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Robinson, 1965] John Alan Robinson. A Machine-Oriented Logic Based on the Resolution Principle. J. ACM, 12(1):23-41, 1965.","title":"A Machine-Oriented Logic Based on the Resolution Principle","authors":"John Alan, Robinson","year":"1965","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Silva and Sakallah, 1996] João P. Marques Silva and Karem A. Sakallah. GRASP -a new search algorithm for satisfiability. In Rob A. Rutenbar and Ralph H. J. M. Otten, editors, Proceedings of the 1996 IEEE/ACM International Conference on Computer- Aided Design, ICCAD 1996, San Jose, CA, USA, November 10- 14, 1996, pages 220-227. IEEE Computer Society / ACM, 1996.","title":"GRASP -a new search algorithm for satisfiability","authors":"P Marques João, Karem A Silva, Sakallah","year":"1996","venue":"Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Urquhart, 1995] Alasdair Urquhart. The complexity of proposi- tional proofs. Bull. Symb. Log., 1(4):425-467, 1995.","title":"The complexity of propositional proofs","authors":"Alasdair Urquhart","year":"1995","venue":"Bull. Symb. Log","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Urquhart, 2011] Alasdair Urquhart. A Near-Optimal Separation of Regular and General Resolution. SIAM J. Comput., 40(1):107- 121, 2011.","title":"A Near-Optimal Separation of Regular and General Resolution","authors":"Alasdair Urquhart","year":"2011","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Xu et al., 2003] Hui Xu, Rob A. Rutenbar, and Karem A. Sakallah. Sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 22(6):814-820, 2003.","title":"Sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing","authors":"Hui Xu, Rob A Rutenbar, Karem A Sakallah","year":"2003","venue":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Zhang and Bacchus, 2012] Lei Zhang and Fahiem Bacchus. MAXSAT Heuristics for Cost Optimal Planning. In Jörg Hoff- mann and Bart Selman, editors, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada. AAAI Press, 2012.","title":"MAXSAT Heuristics for Cost Optimal Planning","authors":"Lei Zhang, Fahiem Bacchus","year":"2012","venue":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}