AN EXTENDED ATMS FOR DECOMPOSABLE PROBLEMS

When dealing with nearly decomposable problems such as those described by Simon (1973), the problem components may be worked on by different problem solvers that are spatially and temporally separated, with each problem solver constrained by assumptions it makes about the activities and choices of other problem solvers, that is by partial knowledge of the global problem. There are advantages to maintaining multiple solutions locally for as long as possible, even though a single final solution is desired. When it becomes less desirable to retract certain assumptions, these become constraints for other problem solvers and can be communicated to them via a truth maintenance system. We describe an extended architecture for an ATMS for these kinds of decomposable problemsInformation Systems Working Papers Serie

AN EXTENDED ATMS FOR DECOMPOSABLE PROBLEMS

When dealing with nearly decomposable problems such as those described by Simon (1973), the problem components may be worked on by different problem solvers that are spatially and temporally separated, with each problem solver constrained by assumptions it makes about the activities and choices of other problem solvers, that is by partial knowledge of the global problem. There are advantages to maintaining multiple solutions locally for as long as possible, even though a single final solution is desired. When it becomes less desirable to retract certain assumptions, these become constraints for other problem solvers and can be communicated to them via a truth maintenance system. We describe an extended architecture for an ATMS for these kinds of decomposable problemsInformation Systems Working Papers Serie