G. Salzer. Solvable classes of cycle unification problems. IMYCS, Smolenice (CSFR), 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Satisfiability of the Smallest Binary Program - Hanschke, Würtz (1993) (9 citations) (Correct)
....are unifiable. For this class an upper limit of necessary self applications of the cycle can be computed such that all further self applications lead to variants of previously computed solutions. Whereas the problems in [BHW92] and [Wur92] only allow finitely many different solutions, G. Salzer [Sal92] has proved a class of cycle unification problems to be decidable which allows for infinitely many different solutions (he uses so called R terms as a 7 means to represent infinite sets of first order terms finitely) Acknowledgment: We would like to thank Manfred Schmidt Schau and Gernot Salzer ....
G. Salzer. Solvable classes of cycle unification problems. IMYCS, Smolenice (CSFR), 1992.
Smallest Horn Clause Programs - Devienne, Lebègue, Parrain.. (1994) (7 citations) (Correct)
....cases where there exists a substitution oe such that oeleft = right or left = oeright, called left (resp. right) matching 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 ....
Salzer G. "Solvable Classes of Cycle Unification Problems." IMYCS, Smolenice (CSFR). 1992.
The Emptiness Problem of One Binary Recursive Horn.. - Devienne.. (1993) (Correct)
....decidable when goal and fact are ground 1 . M. Dauchet, P. Devienne and P. Leb egue [4] 6] studied the linear 2 case and proved it decidable as well. W. Bibel, S. Holldobler and J. Wurtz [2] have considered the emptiness problem and have proved it decidable for some particular cases (see also [16, 18]) In [7] we have proved the halting problem to be undecidable in the general case. In this paper, using a similar proof technique based on the codification of the unpredictable iterations of J.H. Conway within number theory [3] which code Minsky machines [14] we will show that the emptiness ....
Salzer G. "Solvable Classes of Cycle Unification Problems." IMYCS, Smolenice (CSFR). 1992.
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