Abstract
The paper gives four semantic models for Guarded Horn Clauses (GHC). Two operational models are based on a transition system; the first one gives the set of computed answer substitutions (the so-called success set) and the second one takes deadlock and infinite behaviour into account. They are easily related. The main purpose of the paper is to develop compositional models for GHC that are correct with respect to the operational models. For the success set case we give a compositional declarative semantics which can be seen a an extension of models for Horn Clause Logic. Further, a metric semantics that uses tree-like structures is given, which is proved to be correct with respect to the second operational semantics.KeywordsLogic ProgramOperational SemanticDenotational SemanticCompositional SemanticCurrent SubstitutionThese 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.
