Devienne P. "Les Graphes orient'es pond'er'es : un outil pour l"etude de la terminaison et de la complexit'e dans les syst`emes de r'e'ecritures et en programmation logique." Ph. D. Thesis. Lille. 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Smallest Horn Clause Programs - Devienne, Lebègue, Parrain.. (1994) (7 citations) Self-citation (Devienne) (Correct)
....problem is decidable if the goal is linear and undecidable if the rule is right linear. We now consider the case where the rule is left linear. The proof of the following result uses a completely different method from the previous one. It is based on the weighted graphs. We refer the reader to [16, 17, 32, 22]. Theorem 6.3. The halting problem of a left linear binary Horn clause, when given a goal, is decidable. 6.4. Conclusion We conclude that for a program of the following pattern : the halting problem is decidable as soon as one of the terms left or goal is linear. These results are ....
Devienne P. "Les Graphes orient'es pond'er'es : un outil pour l"etude de la terminaison et de la complexit'e dans les syst`emes de r'e'ecritures et en programmation logique." Ph. D. Thesis. Lille. 1987.
The Emptiness Problem of One Binary Recursive Horn.. - Devienne.. (1993) Self-citation (Devienne) (Correct)
....program depending on the linearity of the terms goal, left, right and fact. We prove that the halting problem becomes decidable as soon goal or left are linear. The emptiness problem remains undecidable in the linear Horn clause case. The proof in the first case is based on the weighted graphs [4, 5, 12, 6]. In the second case, we use the same method as for Theorem 5.1, we simply transform any append like program in an equivalent one by linearizing the Horn clause. We are not going to give the detailed proofs here, they will appear soon in a extended report and can be actually communicated to all ....
Devienne P. "Les Graphes orient'es pond'er'es : un outil pour l"etude de la terminaison et de la complexit'e dans les syst`emes de r'e'ecritures et en programmation logique." Ph. D. Thesis. Lille. 1987.
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