Abstract
In this paper, the properties of higher-order neural networks are exploited in a new class of Petri nets, called higher-order Petri nets (HOPN). Using the similarities between neural networks and Petri nets this paper demonstrates how the McCullock-Pitts models and the higher-order neural networks can be represented by Petri nets. A 5-tuple HOPN is defined, a theorem on the relationship between the potential firability of the goal transition and the T-invariant (HOPN) is proved and discussed. The proposed HOPN can be applied to the polynomial clause subset of first-order predicate logic. A five-clause polynomial logic program example is also included to illustrate the theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
