An Enhanced Features Extractor for a Portfolio of Constraint Solvers
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro

TL;DR
This paper introduces a flexible feature extraction framework for constraint problem portfolios, demonstrating that these features enable effective solver selection across different modeling languages, improving performance over existing methods.
Contribution
The paper presents a novel, adaptable feature extractor for constraint problems in multiple languages, enhancing solver portfolio performance and competitiveness.
Findings
Features improve solver selection accuracy
Framework is effective across different modeling languages
Performance is competitive with state-of-the-art CSP portfolios
Abstract
Recent research has shown that a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. The solver selection is usually done by means of (un)supervised learning techniques which exploit features extracted from the problem specification. In this paper we present an useful and flexible framework that is able to extract an extensive set of features from a Constraint (Satisfaction/Optimization) Problem defined in possibly different modeling languages: MiniZinc, FlatZinc or XCSP. We also report some empirical results showing that the performances that can be obtained using these features are effective and competitive with state of the art CSP portfolio techniques.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Scheduling and Timetabling Solutions · Data Management and Algorithms
