Content deleted Content added
m [+pl] |
domains |
||
Line 8:
[[Temporal concurrent constraint programming]] (TCC) and [[non-deterministic temporal concurrent constraint programming]] (NTCC) are variants of constraint programming that can deal with time.
Constrained programming often target certain domains. The most popular are:
*[[Boolean algebra|boolean ___domain]], where true/false constraints apply.
*[[Linear algebra|linear ___domain]], where only [[linear]] functions are described and analyzed. (A few approaches to unlinear problems do exist.)
*[[Finite|finite ___domain]] where constraints are defined over [[countable set]]s.
*Mixed ___domain involving some of the above mentioned domains.
See also
| |||