B.A. Nadel and J. Lin, Automobile transmission design as a constraint satisfaction problem: modelling the kinematic level. AI EDAM 5(3), 137-171 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
FAMING: Supporting Innovative Mechanism Shape Design - Faltings, Sun (1996) (3 citations) (Correct)
....method for solving abductive problems in general is to search the space of potential solutions. For example, there is a very successful program which invents novel automatic transmissions for automobiles by searching the space of all physically possible topologies allowed by a certain technology ([25]) This technique is successful in producing innovations because (i) a computer can search through large numbers of candidates, and (ii) a computer is much better than people at providing the correct analysis of a device s behavior. While transmissions can be modelled by a fixed set of ....
Bernard A. Nadel, Jiang Lin: "Automobile Transmission Design as a Constraint Satisfaction Problem: First Results," in C. Tong, D. Sriram (eds.): Artificial Intelligence in Engineering Design, Academic Press, 1992
FAMING: Supporting Innovative Design using Adaptation: A.. - Faltings (2002) (Correct)
....method for solving abductive problems in general is to search the space of potential solutions. For example, there is a very successful program which invents novel automatic transmissions for automobiles by searching the space of all physically possible topologies allowed by a certain technology ([25]) This technique is successful in producing innovations because (i) a computer can search through large numbers of candidates, and (ii) a computer is much better than people at providing the correct analysis of a device s behavior. While transmissions can be modelled by a fixed set of ....
Bernard A. Nadel, Jiang Lin: "Automobile Transmission Design as a Constraint Satisfaction Problem: First Results," in C. Tong, D. Sriram (eds.): Artificial Intelligence in Engineering Design, Academic Press, 1992 24
The Complexity Of Maximal Constraint Languages - Bulatov, Krokhin, Jeavons (2001) (4 citations) (Correct)
.... it possible to obtain generic structural results concerning the computational complexity of constraint satisfaction problems that can be applied in many di erent areas such as database theory [27] temporal and spatial reasoning [25] machine vision [17] belief maintenance [7] technical design [18], natural language comprehension [1] and programming language analysis [19] The general constraint satisfaction problem is NP complete. There are two main streams in the study of this problem: the search for heuristics (see e.g. 6, 16] and the investigation of how restricting the allowed ....
Nadel B.A., Lin J., Automobile transmission design as a constraint satisfaction problem: Modeling the kinematic level", Articial Intelligence for Engineering Design, Analysis and Manufacturing (AI EDAM), 5(3), 1991, 137-171.
Minimal Forward Checking - Dent, Mercer (1994) (13 citations) (Correct)
....hard random problems are presented which show that MFC outperforms FC especially for problems with large domain sizes and or a large number of variables. 1 Introduction Many problems in Artificial Intelligence and Operations Research can be expressed as Constraint Satisfaction Problems (CSPs)[4, 8, 15]. A CSP is represented with a set of variables, a set of finite discrete domains for those variables, and a set of constraints over those variables. In this paper we restrict our attention to binary CSP s where all the constraints are of arity 2. The general problem is to find a satisfying ....
B. Nadel and J. Lin. Automobile Transmission Design as a Constraint Satisfaction Problem: Modeling the Kinematic Level. Artificial Intelligence in Engineering Design Analysis and Manufacturing (AIEDAM), 5(3), 1991.
Extending GENET for Non-Binary Constraint Satisfaction Problems - Lee, Leung, Won (1995) (1 citation) (Correct)
....Our implementation also compares well against CHIP, PROCLANN, and GENET. 1 Introduction Many problems in artificial intelligence and computer science in general can be formulated as constraint satisfaction problems (CSP s) Some examples are computer vision [1] machine design and manufacturing [2], temporal reasoning [3] and scheduling [4] A CSP can be stated as follows: given a set of variables, a finite and discrete domain of possible values for each variable and a conjunction of constraints limiting the combination of values that the variables can take, the goal is to find a consistent ....
B. Nadel and J. Lin, "Automobile transmission design as a constraint-satifaction problem: Modeling and kinetic level", Artificial Intelligence for Engineering Design, Analysis, and Manufacturing, vol. 5, no. 2, 1991.
Forward Checking with Backmarking - June Patrick Prosser (1995) (13 citations) (Correct)
No context found.
B.A. Nadel and J. Lin, Automobile transmission design as a constraint satisfaction problem: modelling the kinematic level. AI EDAM 5(3), 137-171
Algorithms for Constraint-Satisfaction Problems: A Survey - Kumar (1992) (191 citations) (Correct)
No context found.
:135--178. Nadel, B., and Lin, J. 1991. Automobile Transmission Design as a Constraint-Satisfaction Problem: Modeling the Kinematic Level. Artificial Intelligence for Engineering Design, Analysis, and Manufacturing
Algorithms for Constraint Satisfaction Problems: A Survey - Kumar (1992) (191 citations) (Correct)
No context found.
Nadel, B. and Lin, J. 1991. Automobile Transmission Design as a Constraint Satisfaction Problem: Modeling the Kinematic Level. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (AI EDAM), 5(2), (to appear).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC