SAT MCM: Using Boolean Satisfiability to solve SCM/MCM problems
Copyright (C) 2023 
Nicolai Fiege, University of Kassel, Germany, nfiege@uni-kassel.de
Peter Zipf, University of Kassel, Germany, zipf@uni-kassel.de
Martin Kumm, Fulda University of Applied Sciences, Germany, martin.kumm@informatik.hs-fulda.de

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.

Please contact us for special licenses intended for commercial use.
