Subdefinite Models as a Variety of Constraint Programming

Authors:
V. Telerman;D. Ushakov
Affiliations:
-;-
Venue:
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Year:
1996

Citing 0
Cited 4

Using “weaker” functions for constraint propagation over real numbers

Proceedings of the 1999 ACM symposium on Applied computing
Symbolic-interval cooperation in constraint programming

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Value Constraints in the CLP Scheme

Constraints
Using Constraint Solvers in CAD/CAM Systems

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes sub-definite models as a variety of constraint satisfaction problem. The use of the method of sub-definite calculations makes it possible to solve over determined and underdetermined problems, as well as problems with uncertain, imprecise and in-complete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples are given to show the capabilities of this approach for solving a wide class of problems.