Abstract
Intuitively, the more constraints we impose on a problem, the more difficult it is to solve it. However, in practice, difficult-to-solve problems sometimes get solved when we impose additional constraints and thus, make the problems seemingly more complex. In this methodological paper, we explain this seemingly counter-intuitive phenomenon, and we show that, dues to this explanation, additional constraints can serve as a useful heuristic in solving difficult problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aberth, O.: Precise Numerical Analysis Using C++. Academic Press, New York (1998)
Beeson, M.J.: Foundations of Constructive Mathematics. Springer, New York (1985)
Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)
Bishop, E., Bridges, D.S.: Constructive Analysis. Springer, New York (1985)
Bridges, D.S.: Constructive Functional Analysis. Pitman, London (1979)
Bridges, D.S., Via, S.L.: Techniques of Constructive Analysis. Springer, New York (2006)
Busemann, H.: The Geometry of Geodesics. Dover Publ., New York (2005)
Chandrasekhar, S.: Beauty and the quest for beauty in science. Physics Today 32(7), 25–30 (1979); reprinted in 62(12), 57–62 (2010)
Kohlenbach, U.: Theorie der majorisierbaren und stetigen Funktionale und ihre Anwendung bei der Extraktion von Schranken aus inkonstruktiven Beweisen: Effektive Eindeutigkeitsmodule bei besten Approximationen aus ineffektiven Eindeutigkeitsbeweisen. Ph.D. Dissertation, Frankfurt am Main (1990) (in German)
Kohlenbach, U.: Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin’s proof for Chebycheff approximation. Annals for Pure and Applied Logic 64(1), 27–94 (1993)
Kohlenbach, U.: Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Springer, Heidelberg (2008)
Kreinovich, V.: Uniqueness implies algorithmic computability. In: Proceedings of the 4th Student Mathematical Conference, pp. 19–21. Leningrad University, Leningrad (1975) (in Russian)
Kreinovich, V.: Reviewer’s remarks in a review of Bridges, D.S.: Constrictive functional analysis. Pitman, London (1979); Zentralblatt für Mathematik 401, 22–24 (1979)
Kreinovich, V.: Categories of space-time models. Ph.D. dissertation, Novosibirsk, Soviet Academy of Sciences, Siberian Branch. Institute of Mathematics (1979) (in Russian)
Kreinovich, V.: Physics-motivated ideas for extracting efficient bounds (and algorithms) from classical proofs: beyond local compactness, beyond uniqueness. In: Abstracts of the Conference on the Methods of Proof Theory in Mathematics, June 3-10, p. 8. Max-Planck Institut für Mathematik, Bonn (2007)
Kreinovich, V.: Any (true) statement can be generalized so that it becomes trivial: a simple formalization of D. K. Faddeev’s belief. Applied Mathematical Sciences 47, 2343–2347 (2009)
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational complexity and feasibility of data processing and interval computations. Kluwer, Dordrecht (1998)
Kushner, B.A.: Lectures on Constructive Mathematical Analysis. Amer. Math. Soc. Providence, Rhode Island (1984)
Lacombe, D.: Les ensembles récursivement ouvert ou fermés, et leurs applications à l’analyse récurslve. Compt. Rend. 245(13), 1040–1043 (1957)
Lifschitz, V.A.: Investigation of constructive functions by the method of fillings. J. Soviet Math. 1, 41–47 (1973)
Longpré, L., Kreinovich, V., Gasarch, W., Walster, G.W.: m Solutions Good, m − 1 Solutions Better. Applied Math. Sciences 2(5), 223–239 (2008)
Pour-El, M., Richards, J.: Computability in Analysis and Physics. Springer, New York (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kosheleva, O., Ceberio, M., Kreinovich, V. (2014). Adding Constraints – A (Seemingly Counterintuitive but) Useful Heuristic in Solving Difficult Problems. In: Ceberio, M., Kreinovich, V. (eds) Constraint Programming and Decision Making. Studies in Computational Intelligence, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-04280-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-04280-0_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04279-4
Online ISBN: 978-3-319-04280-0
eBook Packages: EngineeringEngineering (R0)