OKlibrary  0.2.1.6
OKlib::Satisfiability Namespace Reference

The part of the OKlibrary concerned with (generalised) satisfiability. More...

Namespaces

namespace  Algorithms
 

Components for (generalised) SAT algorithms.


namespace  Assignments
 

The part of the OKlibrary concerned with assignments (partial and total)


namespace  Enumeration
 

Supermodule for counting, enumerating and sampling SAT problems.


namespace  FiniteFunctions
 

Algorithms and representations for finite (especially boolean) functions


namespace  Heuristics
 

Components for heuristics.


namespace  Interfaces
 

The supermodule with components for satisfiability interfaces.


namespace  ProblemInstances
 

The supermodule with components for problem instances.


namespace  ProofSystems
 

Super-module on proof systems.


namespace  Quantification
 

Components for quantified generalised SAT problems.


namespace  Reductions
 

Super-module for reductions.


namespace  Solvers
 

Super-module on solvers.


namespace  SpecialStructures
 

Super-module on special structures (relevant for SAT-solving)


namespace  Transformers
 

The supermodule with components for transformers into SAT.


namespace  Values
 

The part of the OKlibrary concerned with values (of variables)



Detailed Description

The part of the OKlibrary concerned with (generalised) satisfiability.

Alias "Sat".