Abstract
Abstract In logic programming, a program is stipulated as a set of axioms; execution of such a program involves posing a goal statement (i.e., theorem) and having the system construct a proof. Mechanical reasoning programs are not able to operate with logical sentences expressed in a broad form instead they use a simpler and more restricted form known as Horn Clauses. Note that Horn clauses have the additional restriction of including at most one non‐negative disjunctive term. The origins of logic programming can be found in the work of the French mathematician Jacques Herbrand. He developed a theorem, published in his doctoral dissertation and which now bears his name, that provides a method for mechanically determining whether a set of clauses is satisfiable. Robinson published a paper in 1965 describing the unification algorithm and the resolution principle. Kowalski built upon this work and demonstrated that Horn clause statements can be interpreted as recursive procedures.
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.
