Theory COMPONENTS-WITH-CONSTRAINTS

• Last modified: Saturday, 30 July 1994
• Source code: components-with-constraints.lisp
• List of all known theories

Theory documentation:

This theory combines components and constraints. Components are associated with constraints by the binary relation has-constraint. Constraint satisfaction is the application of these constraints to components using satisfies-constraint. A valid-component is a component for which all of its constraints are satisfied, and all of its subcomponents are valid components. Parameters are associated with components via unary functions called parameter-slot's.

Notes:

• (c) 1994 Thomas R. Gruber and Gregory R. Olsen
  

Cross Reference Report:

Theories included by Components-With-Constraints:

  Component-Assemblies
  Parametric-Constraints

Theories that include Components-With-Constraints:

  Mace-Domain
  Vt-Design

2 classes defined:

    Parameter-Slot
    Valid-Component

5 relations defined:

  Constraint-On
  Has-Constraint
  Has-Parameter-Slot
  Parameter-Slot-Of
  Used-In-Constraint

No functions defined.

No instances defined.

2 classes defined:

  Parameter-Slot
  Valid-Component

All constants that were mentioned were defined.