Automatic Recognition of Tractability in Inference Relations

A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is non-trivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.

Industrial Relations and "Humanware"

This is a preliminary paper. Please do not quote without the permission of the author. The research on which this paper is based has been conducted with the collaboration of John Paul MacDuffie, MIT. The researchers owe much to the warm cooperation of managers, employees, and union officials of Japanese auto companies and joint venture companies in the U.S. as well as American auto companies and the UAW. We would like to express our sincere appreciation for their assistance.

Supplier Relations in Japan and the United States

This working paper was originally printed in the Working Paper Series of the MIT International Motor Vehicle Program