Plans regarding partial assignments.
More...
Go to the source code of this file.
Detailed Description
Plans regarding partial assignments.
 Todo:
 Connections
 Todo:
 Boolean partial assignments

We have a notion of a "partial assignment" in ComputerAlgebra/Satisfiability/Lisp/ClauseSets/BasicOperations.mac.

Syntactically a partial assignment is just a set of literals.

Semantically a partial assignment (as a set of total assignments) is the same as a DNFclause.

We have the relation "phi <= psi", meaning that the set of total assignments for phi is a superset for that of psi. This is the same as the implicationrelation for DNFclauses.

However there are further operations associated with partial assignments:

composition

application phi * F

evaluation phi(v), phi(x), phi(F)

Shall we make a notational difference between "partial assignments" and "partial multiassignments", or is it just depending on the underlying literaltype?
Definition in file PartialAssignments.hpp.