Correct Parallel Status Assignments for the Reason Maintenance System

Authors

Rosanne M. Fulcomer, Washington University in St. Louis
William E. Ball, Washington University in St. Louis

Document Type

Technical Report

Publication Date

1989-05-02

Filename

WUCS-88-26.pdf

Technical Report Number

WUCS-88-26

Abstract

This paper represents a beginning development of a parallel truth maintenance system to interact with a parallel inference engine. We present a solution which performs status assignments in parallel to belief nodes in the Reason Maintenance System (RMS) presented by [3],[4]. We examine a previously described algorithms by [7] which fails to correctly detect termination of the status assignments. Under Petrie's algorithm, termination may go undetected an in certain circumstances (namely the existence of an unsatisfiable circularity) a false detection may occur. We present an algorithm that corrects these problems.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7JM280G

Recommended Citation

Fulcomer, Rosanne M. and Ball, William E., "Correct Parallel Status Assignments for the Reason Maintenance System" Report Number: WUCS-88-26 (1989). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/783