Next: Top-Down Operational Semantics (I)
Up: CLP Program Execution
Previous: Basic Operations of a
- The control part basically implements a search procedure
- Parts of the steps in the search also add / remove / change
constraints
- The search tree is formalized as a transition system between states
- Each node (state) in the search tree contains:
- The goals which remain to be solved
- The constraints the constraint solver can handle
- The constraints the constraint solver cannot handle (yet)
- States are represented as a 3-tuple
- An initial state is
- Final state:
- A successful derivation: final state
Last modification: Thu Oct 7 12:04:03 MEST 1999 <webmaster@clip.dia.fi.upm.es>