The Constraint Reasoning and Optimization contributes to JELIA 2019, 16th European Conference on Logics in Artificial Intelligence, with two papers.
Unifying Reasoning and Core-Guided Search for Maximum Satisfiability by Jeremias Berg and Matti Järvisalo provides an analysis of instance transformations applied in modern maximum satisfiability (MaxSAT) solving, proposes correction set reducibility as a notion that captures inprocessing MaxSAT solving within a state-transition style abstract MaxSAT solving framework, and establishes a general theorem of correctness for applications of SAT-based preprocessing techniques in MaxSAT.
Preprocessing Argumentation Frameworks via Replacement Patterns by Wolfgang Dvořák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen, and Stefan Woltran (with co-authors from Vienna University of Technology, Austria) introduces the notion of replacement patterns as an approach to preprocessing argumentation frameworks, and provides an empirical evaluation of the impact of applying a set of concrete replacement patters on the the runtime behavior of abstract argumentation reasoning systems.