Abstract
The simplicity and elegance of definite clauses makes this formalism attractive from a theoretical point of view. The objects in this formalism are the uninterpreted terms over the Herbrand universe. Programming however is not done exclusively in the Herbrand universe, but uses higher level concepts such as arithmetic. In that sense we can view definite clauses as the Turing machines of Logic Programming. This gap between theory and programming practice can be reduced by introducing user-oriented domains into the formalism. We have seen that this can be achieved without losing the important properties of definite clauses.KeywordsLogic ProgramLogic ProgrammingHorn ClauseDenotational SemanticClosed World AssumptionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
