Semantics for Prolog via Term Rewrite Systems

摘要

Semantics for logic programs using term rewrite systems are presented. Reading program lines from left to right (so reversing the arrows), considering the result as a rewrite system, immediately gives the usual declarative semantics (the least Herbrand model). Then a priority ordering on the rewrite rules is added, giving a procedural semantics for Prolog with depth-first search rule. This gives different semantics in the same setting.