otter_sat 0.0.9

A library for determining the satisfiability of boolean formulas written in conjunctive normal form, developed to support investigation into solvers by researchers, developers, or anyone curious.
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

//! Implementation of clause trait for a (single) literal.

use crate::{
    config::LBD,
    db::atom::AtomDB,
    structures::{
        clause::Clause,
        literal::{abLiteral, Literal},
        valuation::Valuation,
    },
};

impl Clause for abLiteral {
    fn as_string(&self) -> String {
        let mut the_string = String::default();

        the_string.push_str(format!("{self}").as_str());
        the_string
    }

    fn as_dimacs(&self, atoms: &AtomDB, zero: bool) -> String {
        let mut the_string = String::new();

        let the_represenetation = match self.polarity() {
            true => format!(" {} ", atoms.external_representation(self.atom())),
            false => format!("-{} ", atoms.external_representation(self.atom())),
        };
        the_string.push_str(the_represenetation.as_str());

        if zero {
            the_string += "0";
            the_string
        } else {
            the_string.pop();
            the_string
        }
    }

    /// Returns the literal asserted by the clause on the given valuation
    fn asserts(&self, _val: &impl Valuation) -> Option<abLiteral> {
        Some(*self)
    }

    fn lbd(&self, _atom_db: &AtomDB) -> LBD {
        0
    }

    fn literals(&self) -> impl Iterator<Item = &abLiteral> {
        std::iter::once(self)
    }
    fn size(&self) -> usize {
        1
    }

    fn atoms(&self) -> impl Iterator<Item = crate::structures::atom::Atom> {
        std::iter::once(self.atom())
    }

    fn canonical(self) -> super::vClause {
        vec![self]
    }
}