G. Frandsen, "A Denotational Semantics for Logic Programming," DAIMI PB-201, Aarhus Universitet (1985).  Home/Search   Document Not in Database   Summary   Related Articles

....early seventies, it has lasted until 1984 before a denotational semantics for Prolog was presented, viz. JM]a, that gave account to the behavioral aspects of the language. More recently other (denotational) semantics based on several approaches have appeared, e.g. DM]a, Vi]a. See also [Fi] [Fr], AB] BW] Our work on the backtracking language B in the previous sections makes yet another semantics easily available: we can interpret the abstract or uniform statements, declarations and states such that: a set of Prolog clauses can be regarded as a declaration, a Prolog goal corresponds ....

....a straightforward modification of definition 3.3. Execution of actions t 1 =t 2 and procedure calls R (t 1 , t k ) involve unification. We use a black box unification algorithm mgu that yields a most general unifier for two atoms or terms if one exists, and is undefined otherwise. cf. JM]a, [Fr]a. So the effect of the execution of an action t 1 =t 2 in state s is the update sq, i.e. composition of substitutions, of s with respect to the most general unifier q of t 1 and t 2 in state s (and appropriately renamed) Slightly more deviating is procedure handling, since one has to unify ....

G. Frandsen, "A Denotational Semantics for Logic Programming," DAIMI PB-201, Aarhus Universitet (1985).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC