In: JTC-CSCC' 90, pages 530-535. 1990.
Abstract: This paper introduces a Petri net model for reasoning with non-monotonic logic rules and applies Petri net analysis methods to a finite non-monotonic logic theory. Using the Petri net model, we derive an algorithm to find extensions for a given set of non-monotonic logic rules. Other algorithms to find extensions in non-monotonic logic have been investigated by Etherington and Reinfrank. Their methods are relaxation algorithms which are not efficient. The algorithm proposed in this paper is based upon the exclusive relations among transitions and the maximal supports of firing sequences in the Petri net model. Our algorithm to find extensions is decidable assuming that the coverability graph of a Petri net model can be found. Further, it is efficient for a common class of non-monotonic logic.