Problem space: Unconstraints

Operator Overview:

Bead operators form parts of an empty-op operator. Beading, in this specific case, refers to the process of looking at the A/R set and proposing operators that will touch relevant parts of the A/R set so that eventually, implementation chunks built for the empty-op operator will have these relevant parts as part of the conditions of the chunks.

The relevant parts of the A/R set are defined to be syntactic relations that are values of the attribute ^missing-assigner-relations or ^missing-receiver-relations. In addition there is a set of beads to look at certain parts deeper in the structure of the A/R set in order to prevent masking problems. For example, subcat values are beaded through so that comp positions are not masked by adjoin links (especially of prepositions).

Operator Proposal:

Currently, a bead operator is proposed for every relation in the A/R set that is the value of the attribute ^missing-assigner-relations. This effectively means beading only through the receivers-set because only relations in the receivers-set are values of ^missing-assigner-relations.

Operator Application:

The application of a bead operator is trivial; it puts ^annotation done on the attribute ^relation of the operator. However, most of the work has already been done during the proposal of the bead operator because Soar's chunker is going to transfer the conditions for the proposal to the conditions for the implementation chunks built for the empty-op operator.

Operator Reconsider:

Reconsidered and rejected after its application.

Back to the operator hierarchy.

This page written by Han Ming Ong (hanming@cs.cmu.edu)