Abstract
The many connections between the methods of Computational Logic and Integer Programming (IP) are surveyed. It is shown how computational problems arising in formal logic can be solved by IP. Also it is shown how the methods of logic are applicable both to modelling and solving IP models. It is shown how Fourier-Motzkin elimination for Linear Programming, when specialised to 0–1 IP models gives rise to the logic method of Resolution. Finally conventional IP methods are applied to solving logical inference problems.
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.
