NanoByte.SatSolver 0.2.0

DPLL Boolean Satisfiability Solver

Install-Package NanoByte.SatSolver -Version 0.2.0
dotnet add package NanoByte.SatSolver --version 0.2.0
<PackageReference Include="NanoByte.SatSolver" Version="0.2.0" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add NanoByte.SatSolver --version 0.2.0
The NuGet Team does not provide support for this client. Please contact its maintainers for support.

NanoByte SAT Solver is a DPLL Boolean Satisfiability Solver for .NET.

You need to choose the underlying type to use for Literals in Boolean Formulas. This will often be int or string but you can also use any other type that implements the IEquatable&lt;T&gt; interface. You can then create an instance of Solver&lt;T&gt;:

var solver = new Solver<string>();

The library enables you to express Boolean Formulas using implicit casting and operators for human-friendly sample and test code:

Literal<string> a = "a", b = "b", c = "c", d = "d";
var formula = (a | b) & (!a | c) & (!c | d) & a;

For constructing Formulas at run-time you can use a collection-like interface instead:

var formula = new Formula<string>
{
    new Clause<string> {Literal.Of("a"), Literal.Of("b")},
    new Clause<string> {Literal.Of("a").Negate(), Literal.Of("c")},
    new Clause<string> {Literal.Of("c").Negate(), Literal.Of("d")},
    new Clause<string> {Literal.Of("a")}
};

Finally, you can use the solver to determine whether a Formula is satisfiable:

bool result = solver.IsSatisfiable(formula);

When the Solver needs to choose a Literal to assign a truth value to during backtracking, it simply picks the first unset Literal from the list. You can replace this with your own domain-specific logic for better performance by deriving from Solver&lt;T&gt; and overriding the ChooseLiteral() method.

NanoByte SAT Solver is a DPLL Boolean Satisfiability Solver for .NET.

You need to choose the underlying type to use for Literals in Boolean Formulas. This will often be int or string but you can also use any other type that implements the IEquatable&lt;T&gt; interface. You can then create an instance of Solver&lt;T&gt;:

var solver = new Solver<string>();

The library enables you to express Boolean Formulas using implicit casting and operators for human-friendly sample and test code:

Literal<string> a = "a", b = "b", c = "c", d = "d";
var formula = (a | b) & (!a | c) & (!c | d) & a;

For constructing Formulas at run-time you can use a collection-like interface instead:

var formula = new Formula<string>
{
    new Clause<string> {Literal.Of("a"), Literal.Of("b")},
    new Clause<string> {Literal.Of("a").Negate(), Literal.Of("c")},
    new Clause<string> {Literal.Of("c").Negate(), Literal.Of("d")},
    new Clause<string> {Literal.Of("a")}
};

Finally, you can use the solver to determine whether a Formula is satisfiable:

bool result = solver.IsSatisfiable(formula);

When the Solver needs to choose a Literal to assign a truth value to during backtracking, it simply picks the first unset Literal from the list. You can replace this with your own domain-specific logic for better performance by deriving from Solver&lt;T&gt; and overriding the ChooseLiteral() method.

  • .NETFramework 4.0

    • No dependencies.
  • .NETFramework 4.5

    • No dependencies.
  • .NETFramework 4.6.1

    • No dependencies.
  • .NETStandard 2.0

    • No dependencies.
  • .NETStandard 2.1

    • No dependencies.

NuGet packages

This package is not used by any NuGet packages.

GitHub repositories

This package is not used by any popular GitHub repositories.

Version History

Version Downloads Last updated
0.2.0 83 7/19/2020
0.1.2 124 1/10/2020
0.1.1 121 10/14/2019
0.1.0 211 2/20/2019