Index

BCDEFGILMNOPRSTV

B

basic constraint: 2.1 Finite Domains and Constraints
better: 10 Branch and Bound
branch and bound: 10 Branch and Bound

C

capacity constraint: Model
closed choice node: 3.3 The Explorer
constraint: 2.1 Finite Domains and Constraints
constraint store: 2.3 Spaces, Propagators, and Constraint Stores
critical resource: 11.4 Strong Serializers

D

declarative semantics: 2.3 Spaces, Propagators, and Constraint Stores
defined constraint: 4.2 Example: Family
demand: 11.4 Strong Serializers
determines: 2.3 Spaces, Propagators, and Constraint Stores
distribution strategy: 2.8 Distribution Strategies
distributor: 2.8 Distribution Strategies
domain constraint: 2.1 Finite Domains and Constraints
Domain propagation: 2.4 Interval and Domain Propagation
domain splitting: 2.8 Distribution Strategies

E

edge-finding: 11.3 Strong Propagators for Capacity Constraints
entailed: 2.3 Spaces, Propagators, and Constraint Stores

F

failed: 2.3 Spaces, Propagators, and Constraint Stores, 2.3 Spaces, Propagators, and Constraint Stores
finite domain: 2.1 Finite Domains and Constraints
finite domain problem: 2.1 Finite Domains and Constraints
first-class space: 3.4 New Primitives
first-fail distribution strategy: 2.8 Distribution Strategies

G

global slack: 11.4 Strong Serializers

I

inconsistent: 2.3 Spaces, Propagators, and Constraint Stores
interval propagation: 2.4 Interval and Domain Propagation

L

least regret: Distribution Strategy
local slack: 11.4 Strong Serializers

M

makespan: Model
model: 2.10 Models

N

naive distribution strategy: 2.8 Distribution Strategies

O

open choice node: 3.3 The Explorer
operational semantics: 2.3 Spaces, Propagators, and Constraint Stores
ordered: Ordering Tasks by Distribution

P

parent: 3.4 New Primitives
posting of constraints: Posting of constraints
precedence constraints: Model
propagators: 2.3 Spaces, Propagators, and Constraint Stores

R

recomputation: Use Recomputation if Memory Consumption is a Problem
Redundant constraints: 7 Propagators for Redundant Constraints
resource: Model
resource-oriented serializer: 11.4 Strong Serializers

S

scheduling compiler: Script
script: 3 Writing Problem Solvers in Oz
search tree: 2.6 Distribution and Search Trees
serialization: Model
serialize: 11.1.3 Building a House: Serializers
serializer: 11.1.3 Building a House: Serializers
solution: 2.1 Finite Domains and Constraints, 2.3 Spaces, Propagators, and Constraint Stores
solved: 2.3 Spaces, Propagators, and Constraint Stores
space: 2.3 Spaces, Propagators, and Constraint Stores
stable: 2.3 Spaces, Propagators, and Constraint Stores, 2.3 Spaces, Propagators, and Constraint Stores
supply: 11.4 Strong Serializers

T

task-oriented serializer: 11.5.1 The Problem ABZ6
task interval: 11.4 Strong Serializers
tell: 2.3 Spaces, Propagators, and Constraint Stores

V

variable assignment: 2.1 Finite Domains and Constraints

Christian Schulte and Gert Smolka
Version 1.4.0 (20080702)