sat-interface 0.1.1

This crate provides an abstraction interface for SAT solvers.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

// Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0

//! This module implements the traits with the CaDiCal solver

use crate::{AddConstraints, Clause, Formula, Model, SatSolver, SolverState};
use cadical_sys::{CaDiCal, Status};

impl AddConstraints<Clause> for CaDiCal {
    fn insert(&mut self, constraints: &Clause) {
        self.clause6(&constraints.0)
    }
}

impl AddConstraints<Formula> for CaDiCal {
    fn insert(&mut self, constraints: &Formula) {
        for c in constraints.iter() {
            self.insert(c);
        }
    }
}

impl SolverState for Status {
    fn is_sat(&self) -> bool {
        *self == Status::SATISFIABLE
    }

    fn is_unsat(&self) -> bool {
        *self == Status::UNSATISFIABLE
    }

    fn is_unknown(&self) -> bool {
        *self == Status::UNKNOWN
    }
}

impl SatSolver for CaDiCal {
    type Status = Status;

    fn new() -> Self {
        CaDiCal::new()
    }

    fn solve(&mut self) -> Status {
        CaDiCal::solve(self)
    }

    fn val(&mut self, lit: i32) -> bool {
        CaDiCal::val(self, lit) == lit
    }

    fn load_model(&mut self) -> Model {
        let max = self.vars();
        Model::get_model(max as usize, |i| SatSolver::val(self, i as i32))
    }

    fn block_model(&mut self) {
        let max = self.vars();
        let blocking_clause = Clause::new((1..max + 1).map(|i| -self.val(i)).collect());
        self.insert(&blocking_clause);
    }
}