Abstract
One advantage of logic programming is the ability to use formal logic to analyze program behavior. Formal logic provides a basis for demonstrating that a program will behave as the user intends. This paper attempts to present to the non-logician known program behavior results for logic programs in the context of deductive databases. Previous results are extended through an investigation of a class of programs more general than logic programs. Specific attention is given to computational approaches which involve the solution of a finite sequence of progressively larger integer linear programming problems (ILP's). Constraints for such problems are constructed by a form of logical unification. Results indicate that under certain conditions the solution to the last ILP yields a Herbrand model for the original set of statements in logic.
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.
