Constraint programming

F Rossi, P Van Beek, T Walsh - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …

[ΒΙΒΛΙΟ][B] Handbook of constraint programming

F Rossi, P Van Beek, T Walsh - 2006 - books.google.com
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

[ΒΙΒΛΙΟ][B] Handbook of knowledge representation

F Van Harmelen, V Lifschitz, B Porter - 2008 - books.google.com
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Constraint programming systems for modeling music theories and composition

T Anders, ER Miranda - ACM Computing Surveys (CSUR), 2011 - dl.acm.org
Constraint programming is well suited for the computational modeling of music theories and
composition: its declarative and modular approach shares similarities with the way music …

[PDF][PDF] Choco-solver

C Prud'homme, JG Fages - Journal of Open Source Software, 2022 - hal.science
Choco-solver Page 1 HAL Id: hal-03932507 https://hal.science/hal-03932507 Submitted on 10
Jan 2023 HAL is a multi-disciplinary open access archive for the deposit and dissemination of …

Global constraint catalogue: Past, present and future

N Beldiceanu, M Carlsson, S Demassey, T Petit - Constraints, 2007 - Springer
Global Constraint Catalogue: Past, Present and Future Page 1 Constraints (2007) 12:21–62 DOI
10.1007/s10601-006-9010-8 Global Constraint Catalogue: Past, Present and Future Nicolas …

Global constraints

WJ Van Hoeve, I Katriel - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter provides an overview of global constraints. It discusses
different types of constraints, measures of filtering and different compromises between …

Solving subgraph isomorphism problems with constraint programming

S Zampelli, Y Deville, C Solnon - Constraints, 2010 - Springer
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern
graph in a target graph. We introduce in this paper a global constraint and an associated …

General symmetry breaking constraints

T Walsh - International Conference on Principles and Practice of …, 2006 - Springer
We describe some new propagators for breaking symmetries in constraint satisfaction
problems. We also introduce symmetry breaking constraints to deal with symmetries acting …

XCSP3: an integrated format for benchmarking combinatorial constrained problems

F Boussemart, C Lecoutre, G Audemard… - arxiv preprint arxiv …, 2016 - arxiv.org
We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …