#solver #multi-objective #maxsat

macro scuttle-proc

Procedural macros for scuttle. This crate is not intended to be used outside of scuttle.

3 unstable releases

new 0.2.0 May 1, 2025
0.1.1 Feb 23, 2024
0.1.0 Sep 5, 2023

#1110 in Procedural macros

Download history 6/week @ 2025-02-27

146 downloads per month
Used in scuttle

MIT license

12KB
251 lines

Scuttle - A Multi-Objective MaxSAT Solver in Rust

Scuttle is a multi-objective MaxSAT solver written in Rust and based on the RustSAT library and the CaDiCaL SAT solver.

Publications

This solver was used in our CP'23 paper on preprocessing for multi-objective optimization [5], our CPAIOR'24 paper on core boosting [6], and our TACAS'25 paper on proof-logging for multi-objective MaxSAT [7]. Additional material for the CP'23 paper can be found here, material for the CPAIOR'24 paper is available in the cpaior24/ directory, and for the TACAS'25 paper in the tacas25/ directory in this repository.

Algorithms

First argument Description
p-minimal P-Minimal model enumeration as described in [1] and [2]
lower-bounding Lower-bounding search as described in [3] (called "core-guiding" there)
bioptsat Sat-Unsat variant of the BiOptSat algorithm described in [4]

Building

Note: Scuttle requires nightly Rust, which can be installed via rustup.

If you simply want a binary of the solver, you can install it from crates.io by running cargo +nightly install --locked scuttle.

To build the project from source, make sure to initialize the git submodules with git submodule update --init --recursive. You can then build scuttle by running cargo +nightly build.

What's The Name

Apparently "scuttle" is one of multiple term for a group of crabs, which seemed fitting for a multi-objective solver in Rust.

References

  • Takehide Soh and Mutsunori Banbara and Naoyuki Tamura and Daniel Le Berre: Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation, CP 2017.
  • Miyuki Koshimura and Hidetomo Nabeshima and Hiroshi Fujita and Ryuzo Hasegawa: Minimal Model Generation with Respect to an Atom Set, FTP 2009.
  • Joao Cortes and Ines Lynce and Vasco M. Maquinho: New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization, TACAS 2023.
  • Christoph Jabs and Jeremias Berg and Andreas Niskanen and Matti Järvisalo: MaxSAT-Based Bi-Objective Boolean Optimization, SAT 2022.
  • Christoph Jabs and Jeremias Berg and Hannes Ihalainen and Matti Järvisalo: Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization, CP 2023.
  • Christoph Jabs and Jeremias Berg and Matti Järvisalo: Core Boosting in SAT-Based Multi-Objective Optimization, CPAIOR 2024.
  • Christoph Jabs and Jeremias Berg and Bart Boergarts and Matti Järvisalo: Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability, TACAS 2025.

Dependencies

~0.5–1MB
~22K SLoC