Plans regarding boolean functions and generalisations.
More...
Go to the source code of this file.
Detailed Description
Plans regarding boolean functions and generalisations.
 Todo:
 Create milestones
 Todo:
 Connections to other modules
 Todo:
 General plans

An important motivation is the task of, given a finite function, find a representation of it by generalised CNF/DNF, propositional logic, CSPs, alliances of active clausesets etc.

So from this point of view, finite functions are building blocks in representations of (generalised) satisfiability problem instances, and the task is to transform the whole representation into an alliance of active clausesets.

But finite functions are also interesting in their own right. Constructing smallest circuits or smallest branching programs for example are interesting tasks (involving themselves satisfiability problems).

So various forms of general computational representations need to be supported, together with conversions to other forms.

Such "conversions" might involve satisfiability problems in various forms.

However, automata are not considered here, since we are studying here "combinatorial" (nonuniform) computations.

Perhaps we have a module ComputerAlgebra/Automata, where various forms of automata are provided, and there then, for a given input size, various forms of representations of this finite function (e.g., as a circuit), are also provided. See "Module ComputerAlgebra/Automata" in ComputerAlgebra/plans/general.hpp.
 Todo:
 Quadratic functions
Definition in file general.hpp.