There are two kinds of approaches for termination analysis of logic programs: “transformational” and “direct” ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a term rewrite system (TRS) and then analyze termination of the resulting TRS instead. Thus, transformational approaches make all methods prev...

Solving equations in the free algebra T (F; X) (i.e. uniication) uses the two rules: f(~ s) = f(~ t) ! ~ s = ~ t (decomposition) and sx] = x !? (occur-check). These two rules are not correct in quotients of T (F; X) by a nitely generated congruence = E. Following C. Kirchner, we rst deene classes of equational theories (called syntactic and cycle syntactic respectively) for which it is possible...

Termination properties of actual Prolog systems with constraints are fragile and difficult to analyse. The lack of the occurs-check, moded and overloaded arithmetical evaluation via is/2 and the occasional nontermination of finite domain constraints are all sources for invalidating termination results obtained by current termination analysers that rely on idealized assumptions. In this paper, w...

Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program de nitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more in nite subterms but with a nite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two ...

In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...

During the execution of functional logic programs particular E uni cation pro blems have to be solved quite frequently In this paper we contribute to the e cient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers We formalize the implementation of a deter ministic partial E uni cation algorithm on a deterministic abstract ...

We describe here a simple application of rational trees to the implementation of an interpreter for a procedural language written in a logic programming language. This is possible in languages designed to support rational trees (such as Prolog II and its descendants), but also in traditional Prolog, whose data structures are initially based on Herbrand terms, but in which implementations often ...

We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D), where the parameter D is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of logic programs Pat(<), which is due to Cortesi et al. However, the formalization of our CLP abstract domain is independent...