Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Maria Garcia de la Banda. Beyond Optimal Solutions for Real-World Problems (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{garciadelabanda:LIPIcs.CP.2023.1, author = {Garcia de la Banda, Maria}, title = {{Beyond Optimal Solutions for Real-World Problems}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.1}, URN = {urn:nbn:de:0030-drops-190384}, doi = {10.4230/LIPIcs.CP.2023.1}, annote = {Keywords: Combinatorial optimisation systems, usability, trust, maintenance} }
Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Jinqiang Yu, Alexey Ignatiev, and Peter J. Stuckey. From Formal Boosted Tree Explanations to Interpretable Rule Sets. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 38:1-38:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{yu_et_al:LIPIcs.CP.2023.38, author = {Yu, Jinqiang and Ignatiev, Alexey and Stuckey, Peter J.}, title = {{From Formal Boosted Tree Explanations to Interpretable Rule Sets}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {38:1--38:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.38}, URN = {urn:nbn:de:0030-drops-190758}, doi = {10.4230/LIPIcs.CP.2023.38}, annote = {Keywords: Decision set, interpretable model, gradient boosted tree, BT compilation} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. Incremental Maximum Satisfiability. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{niskanen_et_al:LIPIcs.SAT.2022.14, author = {Niskanen, Andreas and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Incremental Maximum Satisfiability}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.14}, URN = {urn:nbn:de:0030-drops-166885}, doi = {10.4230/LIPIcs.SAT.2022.14}, annote = {Keywords: maximum satisfiability, MaxSAT, incremental optimization, API, implicit hitting set approach} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, and Alexey Ignatiev. Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 47:1-47:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{semenov_et_al:LIPIcs.CP.2021.47, author = {Semenov, Alexander and Chivilikhin, Daniil and Pavlenko, Artem and Otpuschennikov, Ilya and Ulyantsev, Vladimir and Ignatiev, Alexey}, title = {{Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {47:1--47:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.47}, URN = {urn:nbn:de:0030-drops-153381}, doi = {10.4230/LIPIcs.CP.2021.47}, annote = {Keywords: SAT solving, Boolean formula hardness, Backdoors, Evolutionary algorithms} }
Feedback for Dagstuhl Publishing