Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

This seminal text of Computer Science, the most cited book on the subject, is now available
for the first time in paperback. Constraint satisfaction is a decision problem that involves …

Temporal Constraint Networks (TCN) allow one to express minimal and maximal durations
between time-points. Although being used in many research areas, this model disregards …

Abstract Good Old Fashioned Artificial Intelligence and Robotics (GOFAIR) relies on a set of
restrictive Omniscient Fortune Teller Assumptions about the agent, the world and their …

Layout refers to the process of determining the sizes and positions of the visual objects that
are part of an information presentation. Automated layout refers to the use of a computer …

Query folding refers to the activity of determining if and how a query can be answered using
a given set of resources, which might be materialized views, cached results of previous …

A multiscale approach including a finite element framework for polycrystal plasticity is used
to model jerky flow, also known as the Portevin–Le Chatelier effect. The local constitutive …

Publisher Summary This chapter focuses on the emergence of constraint satisfaction, with
constraint languages, as a new paradigm within artificial intelligence and computer science …

We describe a novel integration of Planning with Probabilistic State Estimation and
Execution. The resulting system is a unified representational and computational framework …