Devienne P., Leb`egue P., Routier J.C., Wurtz J. " The Bohm--Jacopini Theorem for Horn Clause Languages." Technical Report IT 252. LIFL. Lille. Juin 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Emptiness Problem of One Binary Recursive Horn.. - Devienne.. (1993) Self-citation (Devienne Leb Routier) (Correct)
....recursive Horn clauses. Indeed, it allows to solve the halting and emptiness problems and a lot of other properties (boudedness, Recently, using this codification (and some other results) we have proved that the append like programs have the same computational power as Turing machines [8]. This result can be seen as the Bohm Jacopini [1] theorem to Logic Programming. Endly, our problem seems to be closed to implication of clause. Considering the program : 8 : p(fact) p(lef t) p(right 1 ) p(right 2 ) p(goal) where fact and goal are ground. The existence of ....
Devienne P., Leb`egue P., Routier J.C., Wurtz J. " The Bohm--Jacopini Theorem for Horn Clause Languages." Technical Report IT 252. LIFL. Lille. Juin 1993.
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