Searching for "Cycle Unification." – sorted by Relevance.
-
Cycle Unification
- the number of iterations through the cycle. In this paper we consider the cycle unification problem
- Cited by 7 (3 self) – Add To MetaCart
-
Term Schematizations and Their Applications
- , 1992. [21] G. Salzer. On the relationship between cycle unification and the unification of infinite
- Add To MetaCart
-
Unifying Cycles
- . In this paper we consider the cycle unification problem of unifying two literals G and F modulo a cycle. We
- Cited by 4 (2 self) – Add To MetaCart
-
Satisfiability of the Smallest Binary Program
- =) L 2 /R 21; : : : ; R 2k . The subject of [BHW92] and [Wur92] is cycle unification. Therein, a binary
- Cited by 10 (3 self) – Add To MetaCart
-
Halting Problem of One Binary Horn Clause is Undecidable.
- . Bibel, S. Holldobler and J. Wurtz [BHW92] call "cycle unification ". Within dynamic analysis, some works
- Cited by 6 (0 self) – Add To MetaCart
-
Smallest Horn Clause Programs
- it decidable for some particular cases 3 . They denoted this problem as the cycle unification problem
- Cited by 8 (0 self) – Add To MetaCart
-
Optimal ambiguity packing in context-free parsers with interleaved unification
- A. This implies that the context-free backbone of the grammar contains a cycle. With unification
- Cited by 3 (1 self) – Add To MetaCart
-
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations
- theoretical, like in model building [Pel97] or cycle unification [Sal94]. One reason is that there are still
- Add To MetaCart

