Undecidability of Termination of CPLC for Computing Supremal Local Support

摘要

In [10] the authors presented a concept called the supremal local support which was used to capture the interaction among local components during distributed diagnosis. To achieve the supremal local support, an algorithm called the Computational Procedure for Local Consistency (CPLC) was provided. It was shown that, if CPLC terminates then the result is the supremal local support. Nevertheless, this paper indicates that the termination of CPLC is undecidable.