DocumentCode :
2610087
Title :
Subdefinite models as a variety of constraint programming
Author :
Telerman, Vitaly ; Ushakov, Dmitry
Author_Institution :
Inst. of Inf. Syst., Res. Inst. of Artificial Intelligence, Novosibirsk, Russia
fYear :
1996
fDate :
16-19 Nov. 1996
Firstpage :
157
Lastpage :
164
Abstract :
This paper describes subdefinite models as a variety of constraint satisfaction problems. The use of the method of subdefinite calculations makes it possible to solve overdetermined and underdetermined problems, as well as problems with uncertain, imprecise and incomplete 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.
Keywords :
constraint handling; formal logic; inference mechanisms; problem solving; uncertainty handling; constraint programming; constraint satisfaction problems; data-driven inference algorithm; imprecise data; incomplete data; overdetermined problem solving; subdefinite calculations; subdefinite models; uncertain data; underdetermined problem solving; Algebra; Artificial intelligence; Computational modeling; Computer science; Inference algorithms; Informatics; Object oriented modeling; Object oriented programming; Set theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence, 1996., Proceedings Eighth IEEE International Conference on
ISSN :
1082-3409
Print_ISBN :
0-8186-7686-7
Type :
conf
DOI :
10.1109/TAI.1996.560446
Filename :
560446
Link To Document :
بازگشت