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.
Chapter PDF
Similar content being viewed by others
References
Freuder E., Wallace R.: Partial Constraint Satisfaction, Artificial Intelligence, 58, pp. 21-70 (1992).
Altshuller G. S.: Creativity as an Exact Science, Gordon and Breach, New York (1988).
Khomenko N., De Guio R.: OTSM Network of Problems for representing and analysing problem situations with computer support, 2nd IFIP Working Conference on Computer Aided Innovation, Technical Center Brighton, Springer, USA (2007).
Ruttkay Zs.: Fuzzy Constraint Satisfaction in Proceedings of the 1st IEEE Conference on Evolutionary Computing, Orlando, pp. 542-547 (1994).
Fargier H., Lang J.: Uncertainty in constraint satisfaction problems: a probabilistic approach. In Proceedings of ECSQARU-93, pp. 97-104 (1993).
Schiex T., Fargier H., Verfaillie G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of International Joint Conference on Artificial Intelligence, Montreal (1995).
Borning A., Freeman-Benson B., Wilson M.: Constraint hierarchies, LISP and symbolic computation. An International Journal, 5, pp. 223-270 (1992).
Jampel M.: A Compositional Theory of Constraint Hierarchies, pp. 189-206. Jampel, Freuder, Maher (Eds.), Over-Constrained Systems, Lecture Notes in Computer Science (1996).
Bistarelli S., Fargier H., Montanari U., Rossi F., Schiex T., Verfaillie G: Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison. Jampel, Freuder, Maher (Eds.), Over-Constrained Systems, Lecture Notes in Computer Science pp. 111-150 (1996).
Bartak R.: Modelling Soft Constraints: A Survey, Neural Network World, vol. 12(5), pp. 421-431 (2002).
Rowan J., Ordinary Ecstasy. The Dialectics of Humanistic Psychology, Brunner-Routledge (2001).
Eltzer T., De Guio, R.: Constraint based modelling as a mean to link dialectical thinking and corporate data. Application to the Design of Experiments, 2nd IFIP Working Conference on Computer Aided Innovation, Springer, Brighton, USA (2007).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 International Federation for Information Processing
About this paper
Cite this paper
Dubois, S., Rasovska, I., De Guio, R. (2008). Comparison of non solvable problem solving principles issued from CSP and TRIZ. In: Cascini, G. (eds) Computer-Aided Innovation (CAI). The International Federation for Information Processing, vol 277. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09697-1_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-09697-1_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09696-4
Online ISBN: 978-0-387-09697-1
eBook Packages: Computer ScienceComputer Science (R0)