Abstract
We show that Forward Chaining in Horn Systems is merely the Simplex Algorithm, although they look completely different. This difference is similar to the one between the Simplex and Transportation Algorithms, in that the latter takes advantage of special structure in the problem. We further show that Backward Chaining is the same as the Dual Simplex Algorithm.
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.
