Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Constraint programming”

Constraint Programming The Constraint Programming Working Group

1996

A constraint can intuitively be thought of as a restriction on a space of possibil-ities. Mathematical constraints are precisely speciable relations among several unknowns (or variables), each taking a value in a given domain. Constraints restrict the possible values that variables can take, representing some (partial)

Cited by 0

Constraint programming

Vujošević, Mirko; id_orcid 0000-0001-9014-7759 · SCIndeks · 2012

The scope of this survey paper is restricted to basic notions, concepts and fundamental approaches to solving constraint programming problems. The accent is put on constraint satisfaction problem. Three main methodological approaches, generate and test, consistency techniques, and constraint propagation, are briefly described as well as the use of constraint graph. Improvements schemes, global constraints and over-constrained problems are also discussed. At the end, some contemporary research and technological challenges are given.

Cited by 0Open access

Constraint Programming

Claude Le Pape · 2013

This chapter contains sections titled: Introduction Problem definition Decision operators Propagation Heuristics Conclusion Bibliography

Cited by 3

Constraint programming

Νικόλαος Ποθητός · 2022

Ο Προγραμματισμός με Περιορισμούς (Constraint Programming) αποσκοπεί στην εύκολη διατύπωση και γρήγορη επίλυση των λεγόμενων Προβλημάτων Ικανοποίησης Περιορισμών (Constraint Satisfaction Problems – CSPs) όπως η κατάστρωση ωρολογίων προγραμμάτων, η ανάθεση συχνοτήτων σε ραδιοφωνικούς σταθμούς χωρίς παρεμβολές μεταξύ τους κ.ά. Για την επίλυση των προβλημάτων, ο Προγραμματισμός με Περιορισμούς βασίζεται στις μεθόδους αναζήτησης (search methods) και στη διάδοση περιορισμών (constraint propagation). Η διατριβή αυτή συνεισφέρει και στους δύο αυτούς πυλώνες. Πιο συγκεκριμένα: (i) Αναπτύσσουμε καινούργιες μεθόδους αναζήτησης που βασίζονται σε καινοτόμους ευρετικούς κανόνες. Οι κανόνες αυτοί υλοποιούν τη βαθμιαία τυχαιοποίηση των ντετερμινιστικών ευρετικών κανόνων. Δημιουργούμε ένα υβρίδιο με στόχο την εκμετάλλευση των πλεονεκτημάτων τόσο των ντετερμινιστικών όσο και των τυχαίων ευρετικών κανόνων. (ii) Αξιοποιούμε το πλαίσιο MapReduce προκειμένου να επιταχύνουμε και να κατανείμουμε την αναζήτηση λύσης ενός Προβλήματος Ικανοποίησης Περιορισμών σε όλους τους επιλυτές-εργάτες που τυχαίνει να έχουμε στη διάθεσή μας. (iii) Αναδεικνύουμε τα πλεονεκτήματα των χαλαρών επιπέδων διάδοσης περιορισμών, όπως η συνέπεια ορίων (bounds consistency) έναντι υψηλότερων επιπέδων όπως η συνέπεια ακμών (arc consistency). Προτείνουμε καινούργιες μορφές χαλαρών επιπέδων διάδοσης περιορισμών και συγκρίνουμε την απόδοσή τους σε σχέση με τα υψηλότερα επίπεδα διάδοσης περιορισμών, τόσο θεωρητικά όσο και πρακτικά. Απαντάμε στην ερώτηση για το πότε συμφέρει να χρησιμοποιούμε χαλαρά επίπεδα διάδοσης περιορισμών. Οι συνεισφορές μας δοκιμάστηκαν ως επί το πλείστον σε Προβλήματα Ικανοποίησης Περιορισμών από τον πραγματικό κόσμο, αλλά και σε μια ευρύτερη γκάμα προβλημάτων που χρησιμοποιούνται σε επίσημους διαγωνισμούς επιλυτών Προγραμματισμού με Περιορισμούς. Ένας τέτοιος πρακτικός επιλυτής ανοικτού κώδικα είναι ο Naxos Solver που χρησιμοποιήσαμε ως το πεδίο εφαρμογής των πειραμάτων.

Cited by 0

Constraint Programming

Pascal Van Hentenryck · Revue Ouverte d Intelligence Artificielle · 2024

This article recounts the story of constraint programming, one of the most remarkable and enduring scientific contributions of Alain Colmerauer. It is a personal story, having lived through, and contributed to, the events that are reported here.

Cited by 2Open access

Constraint Programming

Alexander Bockmayr, John Hooker · Handbooks in operations research and management science · 2005

Cited by 18

Constraint Programming

Patrick Esquirol, Pierre Lòpez, Hélène Fargier et al. · Prodinra (INRA Bordeaux-Aquitaine) · 1995

There has been a lot of interest lately from people solving constrained optimization problems for constraint programming (CP). Constraint programming cannot be described as a technique by itself but perhaps better as a class of computer languages tailored to the expression and resolution of problems which are non-deterministic in nature, with a fast program development and efficient runtime performances. Constraint programming derives from logic programming, operational research and artificial intelligence. Logic programming offers the general non-deterministic host language which accomodates delicated constraint solvers from OR and AI such as linear programming or constraint satisfaction techniques. In this paper, we first review how pure logic programming languages evolved into constraint logic programming (CLP) languages, bringing to light the interface between logic programming and constraint solvers. Some extra attention is given to a specific class of constraint solving techniques which have been developed in the constraint satisfaction problem framework and which are currently used in most CLP languages to solve constrained problems in finite domains. We finally conclude by an overview of some existing CP languages, with some examples taken from scheduling.

Cited by 0Open access

Constraint Programming

MILANO, MICHELA, F. Rossi · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) · 2006

Cited by 0

Constraint Programming

Carl Christian Kuchcinski, Link To Publication, Carl Christian Rolf et al. · 2016

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal? Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Cited by 0

Programming Constraint

Takashi Hattori · 2012

The executable constraint system aims to maintain the integrity of structures that users create during an edit session. When the users modify a part of the structures, other parts are modified accordingly, based on instructions given by the users. The instructions are presented by demonstration, and form a constraint that is satisfied when the current state is its fixed point. The users can dynamically control a set of executable constraints to be satisfied.

Cited by 0

Constraint Programming

Francesca Rossi, Peter Van Beek, Toby Walsh · 2006

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, operations research, algorithms, graph theory and elsewhere. The basic idea in constraint programming is that the user states the constraints and a general purpose constraint solver is used to solve them.

Cited by 8

Constraint Programming

The Constraint Programming Working Group · 1996

Machine, which has proven extremely successful in the context of logic programming. The WAM approach essentially provides a view of the compilation of these languages as a generalization of the standard techniques used in conventional languages, allowing most of the conventional optimizations. Global Analysis. As a result of the compilation-based approach the performance of current systems is quite acceptable when running code where generalpurpose constraint solving is performed. On the other hand, this approach alone cannot always provide performance in the control component that is competitive with other languages. In particular, their performance often does not reach that of traditional logic programming systems in symbolic applications and is generally far from that of traditional imperative programming languages in (non constraint related) numerical applications. The most generally accepted solution to this has been to develop advanced compilation technology capable of detecting ...

Cited by 0