Logic Programs as term Rewriting Systems

This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic program terminates i the corresponding TRS terminates. This transform is re ned in such a way that the above results hold for a relevant class of uni cation free programs containing SWM, the class of Flatly Well Moded (FWM) programs. Note: This work was done during an author's stay at CWI, Amsterdam.

• Type: Conference
• Year: 1994
• Where: ALP
• Authors: Massimo Marchiori
• Keywords: ALP 1994, Automated Reasoning, Corresponding Trs, Logic Program, Relevant Class