Subdefinite computations and symbolic transformations in the uniCalc solver

Семенов, А. Л.; Babichev, Alexander; Leshchenko, A. I.

doi:10.1007/3-540-60156-2_19

Cited by 2 publications

(4 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A new approach to overconstrained or uncertain CSP problems are presented in the main works of Narinyany and all [3][4][5].…”

Section: Main Results Of the Classical Csp Problem Solutionsmentioning

confidence: 99%

“…A large number of problems in Artificial Intelligence and other areas of computer science may be considered as special cases of the Constraint-Satisfaction Problem (CSP) [1][2][3][4][5]. Many mechanical engineering tasks and corresponded optimization problems can be given in the form of requirements with regard to certain parameters of the object to be produced [3][4][5].…”

Section: Introductionmentioning

confidence: 99%

“…Many mechanical engineering tasks and corresponded optimization problems can be given in the form of requirements with regard to certain parameters of the object to be produced [3][4][5]. Graphical user interfaces and interactive editors [6,7] assure certain layout by generating a solution of the CSP reflecting the layout criteria, each time some variables have been changed by the user or by an application program.…”

Section: Introductionmentioning

confidence: 99%

“…Very useful advances for the unified CSP solution techniques related with the Subdefinite Models and Common Stream Solution Algorithms concepts [3][4][5]. This approach to CSP solving provides very communized and effective solution algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Analytical models for CSP problems

Butenkov

Proceedings 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS 2002)

View full text Add to dashboard Cite

A large number of problems in Artificial Intelligence can be viewed as special cases of constraint-satisfaction problem. Some examples are machine vision, optimization, scheduling and etc. A number of different approaches have been developed for solving these problems. Most powerful of them is model-based nonprocedural approach for Generalized Computational Models. In this paper similar approaches are proposed for the geometrical problems and for the largest domain of problems, that can be interpreted as geometrical. The concept of Generalized Geometrical Models are proposed and used for the data analysis, optimal control etc.

show abstract

“…A new approach to overconstrained or uncertain CSP problems are presented in the main works of Narinyany and all [3][4][5].…”

Section: Main Results Of the Classical Csp Problem Solutionsmentioning

confidence: 99%