TY - GEN
T1 - Constraint acquisition
AU - Freuder, Eugene C.
N1 - Publisher Copyright:
© springer-verlag berlin heidelberg 2002.
PY - 2002
Y1 - 2002
N2 - Many problems may be viewed as constraint satisfaction problems. Application domains range from construction scheduling to bioinformatics. Constraint satisfaction problems involve finding values for problem variables subject to restrictions on which combinations of values are allowed. For example, in scheduling professors to teach classes, we cannot schedule the same professor to teach two different classes at the same time. There are many powerful methods for solving constraint satisfaction problems (though in general, of course, they are NP-hard). However, before we can solve a problem, we must describe it, and we want to do so in an appropriate form for efficient processing. The Cork Constraint Computation Centre is applying artificial intelligence techniques to assist or automate this modelling process. In doing so, we address a classic dilemma, common to most any problem solving methodology. The problem domain experts may not be expert in the problem solving methodology and the experts in the problem solving methodology may not be domain experts.
AB - Many problems may be viewed as constraint satisfaction problems. Application domains range from construction scheduling to bioinformatics. Constraint satisfaction problems involve finding values for problem variables subject to restrictions on which combinations of values are allowed. For example, in scheduling professors to teach classes, we cannot schedule the same professor to teach two different classes at the same time. There are many powerful methods for solving constraint satisfaction problems (though in general, of course, they are NP-hard). However, before we can solve a problem, we must describe it, and we want to do so in an appropriate form for efficient processing. The Cork Constraint Computation Centre is applying artificial intelligence techniques to assist or automate this modelling process. In doing so, we address a classic dilemma, common to most any problem solving methodology. The problem domain experts may not be expert in the problem solving methodology and the experts in the problem solving methodology may not be domain experts.
UR - https://www.scopus.com/pages/publications/84956989476
U2 - 10.1007/3-540-45470-5
DO - 10.1007/3-540-45470-5
M3 - Conference proceeding
AN - SCOPUS:84956989476
SN - 3540438653
SN - 9783540438656
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
BT - Artificial Intelligence, Automated Reasoning and Symbolic Computation - Joint International Conferences AISC 2002 and Calculemus 2002, Proceedings
A2 - Henocque, Laurent
A2 - Calmet, Jacques
A2 - Benhamou, Belaid
A2 - Caprotti, Olga
A2 - Sorge, Volker
PB - Springer Verlag
T2 - Joint Conferences on 6th Artificial Intelligence and Symbolic Computation, AISC 2002 and 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2002
Y2 - 1 July 2002 through 5 July 2002
ER -