Abstract
Given a static logical network, partition-based solutions are investigated. Easily verifiable necessary and sufficient conditions are obtained, and the corresponding formulas are presented to provide all types of the partition-based solutions. Then, the results are extended to mix-valued logical networks. Finally, two applications are presented: 1) an implicit function (IF) theorem of logical equations, which provides necessary and sufficient condition for the existence of IF and 2) converting the difference-algebraic network into a standard difference network.
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 callMore From: IEEE transactions on neural networks and learning systems
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.
