Resumen

GUMUCIO ESCOBAR, Rodrigo Ronald. Programando con restricciones. RevActaNova. [online]. 2011, vol.5, n.1, pp.72-95. ISSN 1683-0789.

Hard combinatorial problems are ubiquitous in our society. They arise in many application domains (e.g., artificial intelligence, data bases, operations research, etc.) and diverse real life settings (e.g., scheduling, timetabling, resource allocation, etc.). Constraint Programming is a technique that manages the complexity of these problems in a simple and even elegant manner. It usually allows us to highly efficiently find solutions to many hard combinatorial problems. This article is an introduction to Constraint Programming. It describes many of its fundamental concepts and techniques through clear and concise examples. It finishes with a practical example, solving a classical problem, using C++.

Palabras clave : declarative programming; combinatorial problem; constraint; constraint programming.

        · resumen en Español     · texto en Español     · Español ( pdf )