Mixed Set Programming

Mixed Set Programming (MSP) is a mathematical logic framework for modeling and solving constraint satisfaction problems. It features higher modeling abstraction and greater descriptive capability.
Introduction
Mixed Set Programming is fundamental for Natural Constraint Language (NCL) which allows programmers to naturally model and efficiently solve problems.
Set Programming does not mean the simple use of set notations, set variables or set constraints in a problem solving system, but rather rigorous and complete set theoretical formulation and reasoning in a systematic way to solve problems. “Set Programming” should not be only a terminology, but must be effective enough in practice, for example, for solving set partitioning and vehicle routing problems. More important, it must really supports "programming", that is, it is fundamental for a programming language such as Natural Constraint Language.

Mixed Set Programming means:
* Constraint solving and reasoning over a mixed domain of reals, integers, Booleans, references, dates/times, and sets;
* Incorporating and combining a simplified form of first order logic, naïve set reasoning, numerical constraints, date/time management and operations research algorithms in a cooperative way for modeling and solving constraint satisfaction problems. Here, set theoretical formulation is fundamental in problem modeling and set theoretical reasoning is crucial in problem solving.

Main Menu

See Also

Main Menu