Handbook of Constraint Programming 1st Edition Francesca Rossipdf download
Handbook of Constraint Programming 1st Edition Francesca Rossipdf download
or textbooks at https://ebookultra.com
https://ebookultra.com/download/handbook-of-constraint-
programming-1st-edition-francesca-rossi/
https://ebookultra.com/download/francesca-1st-edition-bertrice-small/
https://ebookultra.com/download/handbook-of-sas-data-step-
programming-1st-edition-arthur-li/
https://ebookultra.com/download/constraint-handling-rules-1st-edition-
thom-fruhwirth/
https://ebookultra.com/download/philosophical-posthumanism-1st-
edition-francesca-ferrando/
Unity in the Book of Isaiah 1st Edition Benedetta Rossi
https://ebookultra.com/download/unity-in-the-book-of-isaiah-1st-
edition-benedetta-rossi/
https://ebookultra.com/download/the-metre-of-beowulf-a-constraint-
based-approach-michael-getty/
https://ebookultra.com/download/abstinence-education-1st-edition-
isabella-e-rossi/
https://ebookultra.com/download/supranational-citizenship-and-the-
challenge-of-diversity-1st-edition-francesca-strumia/
https://ebookultra.com/download/the-linux-programming-interface-a-
linux-and-unix-system-programming-handbook-1st-edition-michael-
kerrisk/
Handbook of Constraint Programming 1st Edition
Francesca Rossi Digital Instant Download
Author(s): Francesca Rossi, Peter van Beek, Toby Walsh, (eds.)
ISBN(s): 9780444527264, 0444527265
Edition: 1
File Details: PDF, 14.79 MB
Year: 2006
Language: english
FOUNDATIONS OF
ARTIFICIAL INTELLIGENCE
Foundations of Artificial Intelligence
Series Editors
J. Hendler
H. Kitano
B. Nebel
ELSEVIER
AMSTERDAM–BOSTON–HEIDELBERG–LONDON–NEW YORK–OXFORD
PARIS–SAN DIEGO–SAN FRANCISCO–SINGAPORE–SYDNEY–TOKYO
Handbook of Constraint Programming
Edited by
Francesca Rossi
University of Padova
Italy
Toby Walsh
National ICTA Australia &
University of New South Wales
Australia
ELSEVIER
AMSTERDAM–BOSTON–HEIDELBERG–LONDON–NEW YORK–OXFORD
PARIS–SAN DIEGO–SAN FRANCISCO–SINGAPORE–SYDNEY–TOKYO
Elsevier
Radarweg 29, PO Box 211, 1000 AE Amsterdam, The Netherlands
The Boulevard, Langford Lane, Kidlington, Oxford OX5 1GB, UK
Permissions may be sought directly from Elsevier’s Science & Technology Rights
Department in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333;
email: permissions@elsevier.com. Alternatively you can submit your request online by
visiting the Elsevier web site at http://elsevier.com/locate/permissions, and selecting
Obtaining permission to use Elsevier material
Notice
No responsibility is assumed by the publisher for any injury and/or damage to persons
or property as a matter of products liability, negligence or otherwise, or from any use
or operation of any methods, products, instructions or ideas contained in the material
herein. Because of rapid advances in the medical sciences, in particular, independent
verification of diagnoses and drug dosages should be made
ISBN-13: 978-0-444-52726-4
ISBN-10: 0-444-52726-5
ISSN: 1574-6525
06 07 08 09 10 10 9 8 7 6 5 4 3 2 1
Foreword
Constraints are an ubiquitous concept, which in its broader sense pertains to every day
experience: they represent the conditions which restrict our freedom of decision. In fact,
how much our choices are constrained by the external world is a basic philosophical ques-
tion. In the formalized reasoning of scientific disciplines, constraints have been employed
extensively, from logic to numerical analysis, from mathematical programming to opera-
tions research. In computer science, constraints have been with us from the early days, for
modeling, representing and reasoning (see the interesting historical remarks in Chapter 2
of this handbook, Constraint Satisfaction: An Emerging Paradigm).
I see several good reasons for this ubiquity: one is the conceptually clear separation
between the perfectly declarative problem statements and the often cumbersome enumera-
tive efforts for finding solutions. Another reason is the complexity challenge: the classical
constraint satisfaction problem is NP-complete and in fact tautology checking in propo-
sitional calculus (a constraint problem on Boolean variables) has been the touchstone for
this complexity class. A further reason is that large, complex constraint problems often
occur in practice, they must be solved in one way or another, and fast, efficient, systematic
solutions have an enormous economic value.
What I find surprising about constraints is that within artificial intelligence and com-
puter science a relatively recent, relatively uniform body of knowledge has emerged which
often yields decisive advantages over classical, extensively studied and well developed
techniques. As for many success stories within computer science, success is largely due
to a mixture of structures, algorithms, languages, programming techniques and system im-
plementations. The aim of this handbook is to present this knowledge in all its facets.
Different chapters are largely self contained and all contribute to put the subject into focus,
similarly to the Hawaii Keck observatory, where the mirror is composed of 36 hexagonal
segments.
From the conceptual point of view, the main characteristic features of constraint pro-
gramming are constraint propagation, and the identification of various special cases which
make complexity tractable. The former (see Chapter 3) is an inference technique which
makes local constraints stronger without changing the global constraint. The latter issue
concerns both the structure (see Chapter 7, Tractable Structures for Constraint Satisfaction
Problems) and the kind of constraints (see Chapter 8, The Complexity of Constraint Lan-
guages). Less specific, but still very important issues are as follows: Backtracking Search
Algorithms, in Chapter 4; Local Search, in Chapter 5; Global Constraints, in Chapter 6;
Symmetry in Constraint Programming, in Chapter 10; and Modelling, in Chapter 11.
Another surprising fact about constraint theory is the incredibly close relationship with
logic programming. In a rather precise sense logic programming is a way of expressing,
and solving, certain classes of disjunctive, recursive constraints. Furthermore, logic pro-
gramming can be very elegantly generalized to constraint logic programming (see Chapter
v
vi Foreword
12), where the ordinary Herbrand constraint system, and its unification algorithm, are com-
plemented with specific constraint solvers. The interaction with the committed choice lan-
guages studied in the Japanese projects of the eighties also yielded very interesting models
of computation based on constraints. Amalgamation with more common (and efficiently
implemented!) programming languages is also possible (see Chapter 13, Constraints in
Procedural and Concurrent Languages).
Besides and beyond the beauty of its theoretical foundations, what contributes the most
to the practical convenience of constraint programming are: (i) the development of specific
results for important classes of constraints; (ii) the ability of extending the basic theory to
various additional aspects which are very relevant in practice; and (iii) the flexibility and
potential for integration with other modeling and solving methodologies.
About the development of specific results, this handbook includes chapters about con-
straints on finite (Chapter 14), structured (Chapter 17), temporal (Chapter 19), continuous
and interval-based (Chapter 16) domains. The potential to extend the basic theory in evi-
dent in the case of soft constraints, considered in Chapter 9. Ordinary constraints are either
satisfied or not, namely either true or false. Instead soft constraints return a more infor-
mative weight. Interestingly enough, the proposed extensions both accommodate several
important cases (fuzzy, hierarchical, optimization, probabilistic constraints), and still of-
ten exhibit essentially the same solution algorithms. Extensions to random, changing and
distributed/open constraints are treated in Chapters 18, 21 and 20 respectively.
About the last issue, in addition to the seamless integration with logic and imperative
programming languages we mentioned already, quite remarkable are the paradigms result-
ing from the integration of constraint programming with operations research (see Chapter
15), with scheduling and planning (see Chapter 22), with vehicle routing (see Chapter 23),
with component configuration (see Chapter 24), with (electricity, water, oil, data) networks
(see Chapter 25), and with bioinformatics (see Chapter 26).
The global scenario based on service-oriented computing which is now under devel-
opment offers additional theoretical and practical challenges to constraint programming.
Conditions for service deployment and discovery, both functional and involving different
aspects of quality of service, could be expressed in terms of hard and soft constraints, and
the negotiation phases should involve substantial constraint solving abilities. Transactions
among the various actors could also require partially backtrackable behavior or at least
programmable compensations. Some level of real time, distributed, global constraint solv-
ing should be implemented in the middleware, since lots of higher level applications will
be able to take advantage of, and pay for it.
I think that research and practical development in the area of constraint programming
will be very active for quite a while in the future, establishing closer and closer connections
with a variety of other design methodologies and even other disciplines. I consider this
handbook not only a very nice piece of scientific work, but also a contribution quite instru-
mental at disseminating advanced knowledge about constraint programming both within
the inner constraint community and across the much wider audience of potential users.
U GO M ONTANARI
Dipartimento di Informatica
Università di Pisa, Italy
Editors
Francesca Rossi
University of Padova
Italy
Toby Walsh
National ICT Australia &
University of New South Wales
Australia
vii
This page intentionally left blank
Contributors
Rolf Backofen Eugene C. Freuder
Albert-Ludwigs-Universität Cork Constraint Computation Centre &
Germany University College Cork, Ireland
ix
x Contributors
Mark Wallace
Monash University
Australia
Toby Walsh
National ICT Australia &
University of New South Wales
Australia
This page intentionally left blank
Contents
Foreword v
Editors vii
Contributors ix
Contents xiii
I Foundations 1
1 Introduction 3
Francesca Rossi, Peter van Beek, Toby Walsh
1.1 Purpose of the Handbook . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2 Structure and Content . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Future Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3 Constraint Propagation 29
Christian Bessiere
3.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.2 Formal Viewpoint . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
3.3 Arc Consistency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
3.4 Higher Order Consistencies . . . . . . . . . . . . . . . . . . . . . . . . 50
3.5 Domain-Based Consistencies Stronger than AC . . . . . . . . . . . . . 57
3.6 Domain-Based Consistencies Weaker than AC . . . . . . . . . . . . . . 62
3.7 Constraint Propagation as Iteration of Reduction Rules . . . . . . . . . . 68
3.8 Specific Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
xiii
xiv Contents
Language: English
By CYRIL G. HOPKINS.
Work and Knowledge are a stronger team than Work and Work.
Nitrogen
Cowpea Plants. Dry Nitrogen Nitrogen
fixed by
matter, content, amount,
bacteria,
No. Part. cgs. percent. cgs.
cgs.
A1 Ten Tops 3580 4.09 146 125
— plants, Roots 620 1.45 9
with
Tubercles 190 5.97 11
bacteria
present. Total 4390 166
A2 Ten Tops 1560 2.42 38
— plants, Roots 300 .88 3
without Total 1860 41
bacteria
B1 Ten Tops 3970 4.31 171
— plants, Roots 690 1.47 10
with
Tubercles 300 6.05 18
bacteria
present. Total 4960 199 140
B2 Ten Tops 2060 2.69 55
— plants, Roots 430 .88 4
without
bacteria Total 2490 59
C1 Ten Tops 3300 4.33 143
— plants, Roots 520 1.53 8
with
Tubercles 290 5.76 17
bacteria
present. Total 4110 168 124
C2 Ten Tops 1730 2.32 40
— plants, Roots 400 .88 4
without
bacteria Total 2130 44
It may be stated that the infected soy bean soil used in these
experiments was obtained from Mr A. A. Hinkley of Du Bois, Illinois,
who has been growing soy beans on the same land for many years
until it has become well infected. Mr. Hinkley has consented to
furnish infected soy bean soil so far as he is able to do without
serious interference with his regular work, to any one who may
desire it, at a price which will cover his expense and loss. This will
probably amount to about $1.00 for the first 100 pounds and fifty
cents for each additional 100 pounds, in the shipment, including the
cost of bags, the purchaser to pay freight from Bois station, which is
located in Washington County, Illinois, on the Illinois Central
Railroad.
Of course if sweet clover should get into the field and persist in
growing, and if it were found to injure the alfalfa appreciably or
markedly, we can always resort to plowing the ground up and
growing corn or other crops, thus obtaining some benefit from the
leguminous crop for its fertilizing value, and at the same time
completely eradicating the sweet clover, but leaving the soil well
infected with alfalfa bacteria ready to serve in case alfalfa should be
again seeded within a few years.
Conclusions.
In general agriculture in Illinois, whether it be grain farming or
ordinary livestock farming, the growing of legumes is absolutely
essential as a part of any economic system which shall maintain the
fertility of the soil; and for the successful growing of legumes the
presence and assistance of the proper species of nitrogen-gathering
bacteria are also absolutely essential. These facts being granted, it
certainly follows that when sowing any legume on land, where the
same legume has never been grown before, or perhaps where it has
not been successfully grown within recent years, we should always
consider the matter of inoculation; and, unless there is good reason
to believe that the soil has been inoculated by the washing from
other higher lying land where these bacteria are known to be
present or by applications of manure made from that legume, or by
some other such incidental means; or unless there is evidence that
the bacteria are carried with the seed in sufficient quantity to effect
a satisfactory inoculation (as appears to be the case with the
cowpea), then we should inoculate the soil directly with the specific
bacteria required by the legume which we desire to grow.
While some Illinois soils are becoming deficient in phosphorus and
in lime, especially in the southern part of the state, and while
phosphorus[8] and ground limestone can be applied to such soils
with marked benefit and profit, especially for the growing of
legumes, there is abundant evidence that one of the dominant
causes for the failure or unsatisfactory growth of some of our most
valuable legumes, and on some soils the sole cause of failure, is the
absence of the proper nitrogen-gathering bacteria.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookultra.com