Abstract

Neural logic networks are generalized to cater to logical systems where the validity of rules and facts changes with time. To construct a temporal network, the validity of rules and facts is collected at a selection of time instances to determine the connecting weights of the respective instances. The weight of the temporal network is then defined as functions that would produce the known values when the proper time is substituted. Three theorems on temporal pattern recognition are proved. >

Full Text
Paper version not known

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 call

Disclaimer: 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.