The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Principles of Constraint Programming
Abstract
Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis. This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593 · cited 6×
“6 and the ensuing temporal CSP’s were introduced in Allen (1983). The eight spatial relations presented in Figure 2.7 and the composition table given in Figure 2.8 were introduced in Egenhofer (1991). In Egenhofer (1994a) these relations were systematically derived and in Egenhofer (1994b) a connection with the CSP’s…”
InfluentialDepth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Consistency in networks of relations
Mackworth, A. K. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90007-8 · Cited by 2,498
Baader, F., & Nipkow, T. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172752 · Cited by 2,466
Global Optimization Using Interval Analysis
(2003) · CRC Press eBooks · doi:10.1201/9780203026922 · Cited by 1,674
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,629
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
Frequency assignment: Theory and applications
Hale, W. K. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11899 · Cited by 1,344
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
Networks of constraints: Fundamental properties and applications to picture processing
Montanari, U. (1974) · Information Sciences · doi:10.1016/0020-0255(74)90008-5 · Cited by 1,275
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Increasing tree search efficiency for constraint satisfaction problems
Haralick, R. M., & Elliott, G. L. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90051-x · Cited by 1,177
Numerical recipes in C (2nd ed.): the art of scientific computing
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992) · Cambridge University Press eBooks · Cited by 1,156
An Efficient Unification Algorithm
Martelli, A., & Montanari, U. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357169 · Cited by 776
Clowes, M. B. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90005-1 · Cited by 675
Qualitative Spatial Representation and Reasoning: An Overview
Cohn, A. G., & Hazarika, S. M. (2001) · doi:10.5555/1219982.1219984 · Cited by 667
Semiring-based constraint satisfaction and optimization
Bistarelli, S., Montanari, U., & Rossi, F. (1997) · Journal of the ACM · doi:10.1145/256303.256306 · Cited by 630
Reasoning about binary topological relations
Egenhofer, M. J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54414-3_36 · Cited by 628
Partial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 614
Colmerauer, A. (1990) · Communications of the ACM · doi:10.1145/79204.79210 · Cited by 571
Valued constraint satisfaction problems : hard and easy problems
Schiex, T., Fargier, H., & Verfaillie, G. (1995) · Cited by 566
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
Constraint propagation with interval labels
Davis, E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90091-9 · Cited by 531
The CLP( ℛ ) language and system
Jaffar, J., Michaylov, S., Stuckey, P. J., & Yap, R. H. C. (1992) · ACM Transactions on Programming Languages and Systems · doi:10.1145/129393.129398 · Cited by 521
Harvey, W. D., & Ginsberg, M. L. (1995) · Cited by 513
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Waltz, D. L. (1972) · Defense Technical Information Center (DTIC) · Cited by 441
Contradicting conventional wisdom in constraint satisfaction
Sabin, D., & Freuder, E. C. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58601-6_86 · Cited by 387
The semantic foundations of concurrent constraint programming
Saraswat, V., Rinard, M., & Panangaden, P. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99627 · Cited by 384
Extending chip in order to solve complex scheduling and placement problems
Aggoun, A., & Beldiceanu, N. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90068-a · Cited by 304
Reasoning about qualitative temporal information
van Beek, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90011-l · Cited by 276
Constraint logic programming languages
Cohen, J. (1990) · Communications of the ACM · doi:10.1145/79204.79209 · Cited by 230
Borning, A. H., Freeman-Benson, B. N., & Wilson, M. (1992) · LISP and Symbolic Computation · doi:10.1007/bf01807506 · Cited by 219
Deriving the Composition of Binary Topological Relations
Egenhofer, M. J. (1994) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1994.1007 · Cited by 197
Baader, F., & Siekmann, J. H. (1994) · Cited by 182
(1902) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01703364 · Cited by 162
Strategic directions in constraint programming
Hentenryck, P. V., & Saraswat, V. (1996) · CSUR · doi:10.1145/242223.242279 · Cited by 145
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
McGregor, J. J. (1979) · Information Sciences · doi:10.1016/0020-0255(79)90023-9 · Cited by 143
Backjump-based backtracking for constraint satisfaction problems
Dechter, R., & Frost, D. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00120-0 · Cited by 108
Semiring-based CSPs and valued CSPs: Basic properties and comparison
Stefano Bistarelli, B., Faxgier, H., Montanari, U., Rossi, F., Schiex, T., & Verfaillie, G. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61479-6_19 · Cited by 106
Semantic foundations of concurrent constraint programming
Saraswat, V., Rinard, M., & Panangaden, P. (1995) · Cited by 89
Symbolic-interval cooperation in constraint programming
Granvilliers, L., Monfroy, É., & Benhamou, F. (2001) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/384101.384123 · Cited by 44
A heuristic repair method for constraint satisfaction and scheduling problems
Minton, S. (1992) · Cited by 9
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
Review of Optimization Strategies for System-Level Design in Hybrid Electric Vehicles
Silvas, E., Hofman, T., Murgovski, N., Etman, P., & Steinbuch, M. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2547897 · Cited by 323
Metadata
- Authors
- Apt, K.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2003-08-28
- OpenAlex
- W1733489975
- Cited by
- 888
- References
- 46
- FWCI
- 32.97
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.