DocumentCode
2810788
Title
A Petri net with negative tokens and its application automated reasoning
Author
Murata, T. ; Yamaguchi, H.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fYear
1990
fDate
12-14 Aug 1990
Firstpage
762
Abstract
A modified Petri-net model is introduced with negative tokens for automated reasoning programs. In this model, Horn and non-Horn clauses are represented by transitions and predicate symbols by places. UR-resolution is simulated by either forward or background firing of a transition and demodulation by a transition which rewrites tokens. This model is intended to provide a means to analyze structural properties of automated reasoning programs and an operational semantics of programs
Keywords
Petri nets; inference mechanisms; logic programming; Horn clauses; Petri net; UR-resolution; automated reasoning; demodulation; forward firing; modified Petri-net model; negative tokens; nonHorn clauses; operational semantics; predicate symbols; propositional logic; transitions; Algorithm design and analysis; Application software; Artificial intelligence; Automatic control; Circuit synthesis; Computational modeling; Concurrent computing; Demodulation; Expert systems; Logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location
Calgary, Alta.
Print_ISBN
0-7803-0081-5
Type
conf
DOI
10.1109/MWSCAS.1990.140832
Filename
140832
Link To Document