{"type":"ScholarlyArticle","title":"Proof Logging for Smart Extensional Constraints (Extended Abstract)","authors":[{"name":"Matthew J. McIlree","slug":"matthew-j-mcilree","given":"Matthew J.","family":"McIlree","affiliation":"University of Glasgow , Glasgow , Scotland"},{"name":"Ciaran McCreesh","slug":"ciaran-mccreesh","given":"Ciaran","family":"McCreesh","affiliation":"University of Glasgow , Glasgow , Scotland"}],"abstract":"Proof logging provides an auditable way of guaranteeing that a solver has produced a correct answer using sound reasoning. This is standard practice for Boolean satisfiability solving, but for constraint programming, a challenge is that every propagator must be able to justify all inferences it performs. Here we demonstrate how to support proof logging for a wide range of previously uncertified global constraints. We do this by showing how to justify every inference that could be performed by the propagation algorithms for two families of generalised extensional constraint: \"Smart Table\" and \"Regular Language Membership\".","doi":"10.24963/ijcai.2024/938","url":"https://ijcai.org/proceedings/2024/938","pdf":"https://ijcai.org/proceedings/2024/0938.pdf","markdown":"https://ijcai.org/proceedings/2024/938.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/938","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":938,"pages":{"first":8444,"last":8446},"keywords":["Constraint Satisfaction and Optimization: CSO: Constraint programming"],"videos":[],"references":[{"position":1,"raw":"[Baek et al., 2021] Seulkee Baek, Mario Carneiro, and Mar- ijn J. H. Heule. A flexible proof format for SAT solver- elaborator communication. In Tools and Algorithms for the Construction and Analysis of Systems: 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 -April 1, 2021, Proceedings, Part I, page 59-75, Berlin, Heidelberg, 2021. Springer-Verlag.","title":"A flexible proof format for SAT solverelaborator communication","authors":"Baek","year":"2021","venue":"Tools and Algorithms for the Construction and Analysis of Systems: 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bogaerts et al., 2023] Bart Bogaerts, Stephan Gocht, Cia- ran McCreesh, and Jakob Nordström. Certified dominance and symmetry breaking for combinatorial optimisation. J. Artif. Intell. Res., 77:1539-1589, 2023.","title":"Certified dominance and symmetry breaking for combinatorial optimisation","authors":"Bart Bogaerts, Stephan Gocht, Ciaran Mccreesh, Jakob Nordström","year":"2023","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Boussemart et al., 2016] Frédéric Boussemart, Christophe Lecoutre, and Cédric Piette. XCSP3: an integrated for- mat for benchmarking combinatorial constrained prob- lems. CoRR, abs/1611.03398, 2016.","title":"XCSP3: an integrated format for benchmarking combinatorial constrained problems","authors":"Frédéric Boussemart, Christophe Lecoutre, Cédric Piette","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cook et al., 1987] William J. Cook, Collette R. Coullard, and György Turán. On the complexity of cutting-plane proofs. Discret. Appl. Math., 18(1):25-38, 1987.","title":"On the complexity of cutting-plane proofs","authors":"William J Cook, Collette R Coullard, György Turán","year":"1987","venue":"Discret. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cruz-Filipe et al., 2017] Luís Cruz-Filipe, Marijn J. H. Heule, Warren A. Hunt, Matt Kaufmann, and Peter Schneider-Kamp. Efficient certified RAT verification. In Leonardo de Moura, editor, Automated Deduction -CADE 26, pages 220-236, Cham, 2017. Springer International Publishing.","title":"Efficient certified RAT verification","authors":"Luís Cruz-Filipe, J H Marijn, Warren A Heule, Matt Hunt, Peter Kaufmann, Schneider-Kamp","year":"2017","venue":"Automated Deduction -CADE 26","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Elffers et al., 2020] Jan Elffers, Stephan Gocht, Ciaran Mc- Creesh, and Jakob Nordström. Justifying All Differences Using Pseudo-Boolean Reasoning. Proceedings of the AAAI Conference on Artificial Intelligence, 34(02):1486- 1494, April 2020.","title":"Justifying All Differences Using Pseudo-Boolean Reasoning","authors":"Elffers","year":"2020","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gocht et al., 2022] Stephan Gocht, Ciaran McCreesh, and Jakob Nordström. An Auditable Constraint Programming Solver. In Christine Solnon, editor, 28th International Conference on Principles and Practice of Constraint Pro- gramming (CP 2022), volume 235 of Leibniz International Proceedings in Informatics (LIPIcs), pages 25:1-25:18, Dagstuhl, Germany, 2022. Schloss Dagstuhl -Leibniz- Zentrum für Informatik.","title":"An Auditable Constraint Programming Solver","authors":"Stephan Gocht, Ciaran Mccreesh, Jakob Nordström","year":"2022","venue":"28th International Conference on Principles and Practice of Constraint Programming (CP 2022)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gocht, 2022] Stephan Gocht. Certifying Correctness for Combinatorial Algorithms by Using Pseudo-Boolean Rea- soning. PhD thesis, Lund University, Sweden, 2022.","title":"Certifying Correctness for Combinatorial Algorithms by Using Pseudo-Boolean Reasoning","authors":"Stephan Gocht","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Goldberg and Novikov, 2003] Evguenii I. Goldberg and Yakov Novikov. Verification of proofs of unsatisfiabil- ity for CNF formulas. In 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pages 10886-10891. IEEE Computer Society, 2003.","title":"Verification of proofs of unsatisfiability for CNF formulas","authors":"Goldberg, I Novikov ; Evguenii, Yakov Goldberg, Novikov","year":"2003","venue":"2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Heule et al., 2013a] Marijn J. H. Heule, Warren A. Hunt, and Nathan Wetzler. Verifying refutations with extended resolution. In Maria Paola Bonacina, editor, Automated Deduction -CADE-24, pages 345-359, Berlin, Heidel- berg, 2013. Springer Berlin Heidelberg.","title":"Verifying refutations with extended resolution","authors":"Heule","year":"2013","venue":"Automated Deduction -CADE-24","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Heule et al., 2013b] Marijn J.H. Heule, Warren A. Hunt, and Nathan Wetzler. Trimming while checking clausal proofs. In 2013 Formal Methods in Computer-Aided De- sign, pages 181-188, 2013.","title":"Trimming while checking clausal proofs","authors":"Heule","year":"2013","venue":"Formal Methods in Computer-Aided Design","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hoda et al., 2010] Samid Hoda, Willem Jan van Hoeve, and John N. Hooker. A systematic approach to MDD-based constraint programming. In David Cohen, editor, Princi- ples and Practice of Constraint Programming -CP 2010 -16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings, vol- ume 6308 of Lecture Notes in Computer Science, pages 266-280. Springer, 2010.","title":"A systematic approach to MDD-based constraint programming","authors":"Samid Hoda, Willem Jan Van Hoeve, John N Hooker","year":"2010","venue":"Principles and Practice of Constraint Programming -CP 2010 -16th International Conference, CP 2010","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lagerkvist and Pesant, 2008] Mikael Z Lagerkvist and Gilles Pesant. Modeling irregular shape placement problems with regular constraints. In First workshop on bin packing and placement constraints BPPC'08, 2008.","title":"Modeling irregular shape placement problems with regular constraints","authors":"Pesant ; Lagerkvist, Z Mikael, Gilles Lagerkvist, Pesant","year":"2008","venue":"First workshop on bin packing and placement constraints BPPC'08","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Mairy et al., 2015] Jean-Baptiste Mairy, Yves Deville, and Christophe Lecoutre. The Smart Table Constraint. In Laurent Michel, editor, 12th International Conference on Integration of AI and OR Techniques in Constraint Pro- gramming (CPAIOR 2015), Lecture Notes in Computer Science, pages 271-287, Cham, 2015. Springer Interna- tional Publishing.","title":"The Smart Table Constraint","authors":"Mairy","year":"2015","venue":"12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McCreesh and McIlree, 2023] Ciaran McCreesh and Matthew McIlree. The Glasgow Constraint Solver. GitHub repository, 2023.","title":"The Glasgow Constraint Solver","authors":"Ciaran Mccreesh, Matthew Mcilree","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[McIlree and McCreesh, 2023] Matthew J. McIlree and Cia- ran McCreesh. Proof logging for smart extensional con- straints. In Roland H. C. Yap, editor, 29th International Conference on Principles and Practice of Constraint Programming, CP 2023, August 27-31, 2023, Toronto, Canada, volume 280 of LIPIcs, pages 26:1-26:17. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2023.","title":"Proof logging for smart extensional constraints","authors":"Matthew J Mcilree, Ciaran Mccreesh","year":"2023","venue":"29th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pesant, 2004] Gilles Pesant. A Regular Language Mem- bership Constraint for Finite Sequences of Variables. In Mark Wallace, editor, 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), Lecture Notes in Computer Science, pages 482- 495, Berlin, Heidelberg, 2004. Springer.","title":"A Regular Language Membership Constraint for Finite Sequences of Variables","authors":"Gilles Pesant","year":"2004","venue":"10th International Conference on Principles and Practice of Constraint Programming (CP 2004)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}