NAME

Algorithm::SAT::Backtracking::DPLL - A DPLL Backtracking SAT solver written in pure Perl

SYNOPSIS

# You can use it with Algorithm::SAT::Expression
use Algorithm::SAT::Expression;

my $expr = Algorithm::SAT::Expression->new->with("Algorithm::SAT::Backtracking::DPLL"); #Uses Algorithm::SAT::Backtracking by default, you can use "with()" to specify other implementations
$expr->or( '-foo@2.1', 'bar@2.2' );
$expr->or( '-foo@2.3', 'bar@2.2' );
$expr->or( '-baz@2.3', 'bar@2.3' );
$expr->or( '-baz@1.2', 'bar@2.2' );
my $model = $exp->solve();

# Or you can use it directly:
use Algorithm::SAT::Backtracking;
my $solver = Algorithm::SAT::Backtracking->new;
my $variables = [ 'blue', 'green', 'yellow', 'pink', 'purple' ];
my $clauses = [
    [ 'blue',  'green',  '-yellow' ],
    [ '-blue', '-green', 'yellow' ],
    [ 'pink', 'purple', 'green', 'blue', '-yellow' ]
];

my $model = $solver->solve( $variables, $clauses );

DESCRIPTION

Algorithm::SAT::Backtracking::DPLL is a pure Perl implementation of a SAT Backtracking solver.

Look at Algorithm::SAT::Backtracking for a theory description.

The DPLL variant applies the "unit propagation" and the "pure literal" technique to be faster.

Look also at the tests file for an example of usage.

Algorithm::SAT::Expression use this module to solve Boolean expressions.

METHODS

Inherits all the methods from Algorithm::SAT::Backtracking and implements new private methods to use the unit propagation and pure literal rule techniques.

LICENSE

Copyright (C) mudler.

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

AUTHOR

mudler <mudler@dark-lab.net>

SEE ALSO

Algorithm::SAT::Expression, Algorithm::SAT::Backtracking, Algorithm::SAT::Backtracking::Ordered, Algorithm::SAT::Backtracking::Ordered::DPLL