|
Prolog To TES Transformation |
|
Description
This technique implements the transformation described in
[Ohl01].
Given a well-moded logic program P, where without loss of generality all
predicates are of the form P(i1,...,in,o1,...,om) with all
ii of moding type "in" and all oi of moding type "out",
this transformation returns a conditional term rewriting system (CTRS) R with
the useful property, that termination of R implies termination of P.
A Predicate term A(...) of the form
P(i1,...,in,o1,...,om)
gets translated into the TRS rule ρ(A)
pin(i1,...,in) → pout(o1,...,om)
A well moded clause of the form
A(...) :- B(...), C(...), D(...), ...
gets translated into the conditional TRS rule
ρ(B), ρ(C), ρ(D), ... | ρ(A)
Prerequisites
- A well moded logic program
(see Section 2 of [Ohl01])
Configuration
Currently no configuration options are available.