特里兹
约束(计算机辅助设计)
代表(政治)
约束满足问题
计算机科学
数学优化
订单(交换)
管理科学
数学
人工智能
工程类
经济
几何学
法学
政治
概率逻辑
政治学
财务
作者
Sébastien Dubois,Ivana Rasovska,Roland De Guio
出处
期刊:IFIP
日期:2008-08-19
卷期号:: 83-94
被引量:20
标识
DOI:10.1007/978-0-387-09697-1_7
摘要
Inventive problems from many domains are usually problems we are not able to solve. This problem insolvability is often due to the incomplete or unmatched representation model of the problem that does not correspond to the given problem. In this paper, we introduce two problem solving theories for the solutionless problems: Constraint Satisfaction Problem (CSP) and dialectical based methods and models (TRIZ). It is an exploratory analysis of both theories in order to compare grounding approach and tools of both theories. Their potential complementarities will be defined in further objective to improve problem solving strategy for the inventive problems by matching the CSP and TRIZ solving principles. We consider that it will contribute to better understanding of non-solvable problems, i.e. to improve representation models of the problems and to make the problem solving more accurately.
科研通智能强力驱动
Strongly Powered by AbleSci AI