The Constraint Reasoning and Optimization contributed to IJCAI-ECAI 2018 the main 2018 AI conference world-wide with two papers.
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving by Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner, and Stefan Woltran (with co-authors from Vienna University of Technology and University of Genova) will be presented in the main track of IJCAI-ECAI 2018. The paper, dealing with computational models of argumentation, provides complexity results and SAT-based algorithms for beyond-NP reasoning problems over abstract dialectical argumentation framework.
Reduced Cost Fixing for Maximum Satisfiability by Fahiem Bacchus (University of Toronto), Antti Hyttinen, Matti Järvisalo, and Paul Saikko will be presented in the by-invitation-only Sister Conference Best Paper track, and is based on work that received the CP 2017 Distinguished Paper Award. The work investigates utilizing the integer programming technique of reduced cost fixing to improve maximum satisfiability solving, and in particular shows that reduced cost fixing can provide noticeable performance improvements to MaxSAT solvers implementing the implicit hitting set approach.