2002
DOI: 10.1007/3-540-46135-3_48
|View full text |Cite
|
Sign up to set email alerts
|

A Relational Constraint Solver for Model-Based Engineering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2002
2002
2016
2016

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 1 publication
0
0
0
Order By: Relevance
“…The main disadvantage of using it is a large number of possible conflicts 2 n , where n is the number of components. In the previous years, this problem has been an active area of research, in order to find a minimal conflict [18] or the finding all potential minimal conflicts, using CS-Tree [15] or using preprocessing, independence and incrementally features of initial model [9]. In the DX community there are a lot of works in this sense as the calculation the minimal chains which can be evaluated, the minimal models which can also be evaluated [19] and symbolic processing algorithms (Gröbner bases) of the initial model [10].…”
Section: Introductionmentioning
confidence: 99%
“…The main disadvantage of using it is a large number of possible conflicts 2 n , where n is the number of components. In the previous years, this problem has been an active area of research, in order to find a minimal conflict [18] or the finding all potential minimal conflicts, using CS-Tree [15] or using preprocessing, independence and incrementally features of initial model [9]. In the DX community there are a lot of works in this sense as the calculation the minimal chains which can be evaluated, the minimal models which can also be evaluated [19] and symbolic processing algorithms (Gröbner bases) of the initial model [10].…”
Section: Introductionmentioning
confidence: 99%