Devienne P., Leb`egue P., Routier J.C. "The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable" Proceedings of ILPS'93, Vancouver. MIT Press. pp. 250--265. November 1993. Home/Search Document Details and Download
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 Routier) (Correct)
....result confirms the expressiveness of logic programming. The proofs are based on program transformations and encoding of problems, unpredictable iterations within number theory defined by J.H. Conway or the Post correspondence problem. This paper is a survey which covers the results of [19] [20], 21] and [28] Address correspondence to P. Devienne, P. Leb egue, A. Parrain, J.C. Routier, Laboratoire d Informatique Fondamentale de Lille. CNRS URA 369. Universit e des Sciences et Technologies de Lille, Cit e Scientifique, 59655 Villeneuve d Ascq c edex, France. ....
....cycle. begins the cycle, and the fact which terminates the cycle, through the binary Horn clause which defines the cycle. For particular cycle unification classes see [45, 51] In this paper we will show that the two problems are undecidable for append like programs. The proof technic of [19, 20] is based on an original encoding of the unpredictable iterations of J. Conway within number theory [8] which are close to Minsky machines [39] An alternative proof of undecidability of the emptiness problem can be found in [28] It has been made independently and it is based on an encoding of ....
[Article contains additional citation context not shown here]
Devienne P., Leb`egue P., Routier J.C. "The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable" Proceedings of ILPS'93, Vancouver. MIT Press. pp. 250--265. November 1993.
One Binary Horn Clause is Enough - Devienne, Lebègue, Routier.. (1994) (1 citation) Self-citation (Devienne Leb Routier) (Correct)
....of such a class is equivalent to the halting problem for two counter machines which is undecidable [16] H.R. Lewis tried to solve the 4 subformulas case, but without success. This problem remained open until last year and was shown to be undecidable too by two independant ways ( 12] and [9]) The main result of this paper is obtained by merging these two proofs and we establish that this undecidability is of the maximal degree, in other words, this class of formulas has, in fact, the same expressive power than Turing machines. Moreover, this class can be reduced to Horn clause ....
....Horn clause and can be used as a theoretical tool for decision problems in theorem proving. Some applications on other notions or structures are presented in the last section. 2 An Original Codification of the Conway Functions Here we present an original proof method, previously defined in [8, 9] where it was the main basis of the proofs of the undecidability of the halting and emptiness problem for one binary recursive Horn clause. It is based on an original codification of some work by J.H. Conway[5] which we will present briefly here. 2.1 The Conway Unpredictable Iterations J.H. ....
[Article contains additional citation context not shown here]
Devienne P., Leb`egue P., Routier J.C. "The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable." In proceedings of ILPS'93, Vancouver. MIT Press. pp 250--265. October 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