Sebastian Maneth, Heinz Faßbender  @ NUS Home/Search
Context Related
| greyarea.is.tsukuba...JFLPA9804.ps.gz vt.edu/ejournals/JF...JFLPA9804.ps.gz Cached: PS.gz PS PDF Image Update Help From: greyarea.is.tsukuba.ac.j...A9804 (more) From: vt.edu/ejournals/JFLP/jf...A9804 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: During the execution of functional logic programs, E-unification problems have to be solved quite frequently, where the underlying equational theory is induced by recursive functions. But, what about the decidability of those E-unification problems? Up to now, there does not exist a concrete answer to this question for classes of equational theories which are induced by particular recursive functions. In this paper, we try to give an answer to this question by drawing and verifying a strict... (Update)
Context of citations to this paper: More
...terminates) for this example when solving linear equations, since our restrictions are satisfied (see Sect. 4) Fabender and Maneth [23] give a decision procedure for unifiability without representing the set of solutions. However, they need very strong restrictions. Only...
...proof for right ground systems Oyamaguchi used rewrite rules with non linear variable occurrences at different depth. Fassbender Maneth (1996) investigate decidability of E unification in theories induced by TRS called top down tree transducers. Syntactic restrictions...
Cited by: More
E-Unification by Means of Tree Tuple Synchronized Grammars - Limet, Réty (1996) (Correct)
Unification in Extensions of Shallow Equational Theories - Jacquemard, Meyer, Weidenbach (1998) (Correct)
Annual Report 1998: Foundations of Programming - Vogler (1998) (Correct)
Similar documents (at the sentence level):
26.3%: A Strict Border for the Decidability of E-Unification for.. - Maneth, Faßbender (1996) (Correct)
Active bibliography (related documents): More All
0.3: Equational Unification, Word Unification, and 2-Order.. - Otto, Narendran (1996) (Correct)
0.3: Some Independence Results for Equational Unification - Otto, Narendran, Dougherty (1995) (Correct)
0.3: Flow Grammars - a Flow Analysis Methodology - Uhl, Horspool (1994) (Correct)
Similar documents based on text: More All
1.8: A Game-Based Architecture for Developing Interactive Components.. - Stathis (2000) (Correct)
1.8: Embedding Propagators in a Concurrent Constraint Language - Müller, Würtz (1999) (Correct)
1.7: Constraint Logic Programming over Unions of Constraint Theories - Tinelli, al. (1998) (Correct)
Related documents from co-citation: More All
4: A pumping lemma for output languages of macro tree transducers - Kuhnemann - 1995
4: Solving a Unification Problem under Constrained Substitutions Using Tree Automat.. (context) - Kaji, Fujiwara et al. - 1994
4: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
Fabender, H. and Maneth, S. (1996). A strict border for the decidability of E-unification for recursive functions. Proceedings of the Intern. Conf. on Algebraic and Logic Programming. Volume 1139 of LNCS, pp. 194--208. Springer-Verlag. http://citeseer.comp.nus.edu.sg/133035.html More
@inproceedings{ fassbender96strict,
author = "H. Fa{\ss}bender and S. Maneth",
title = "A strict border for the decidability of E-unification for recursive functions",
booktitle = "Proceedings of the Intern. Conf. on Algebraic and Logic Programming",
volume = "1139",
series = "{LNCS}",
pages = "194--208",
publisher = "Springer-Verlag",
year = "1996",
url = "citeseer.comp.nus.edu.sg/133035.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
134 Unification theory - Baader, Siekmann - 1994
126 Canonical forms and unification (context) - Hullot - 1980
121 Logicprogramming with functions and predicates: The language.. (context) - Moreno-Navarro, Rodriguez-Artalejo - 1992
105 The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
74 equivalence (context) - Newman, with et al. - 1942
67 A variant of a recursively unsolvable problem (context) - Post - 1946
38 On completeness of narrowing strategies (context) - Echahed - 1990
37 Uber die Vollstandigkeit eines gewissen Systems der Arithmet.. (context) - Presburger - 1927
33 Mappings and grammars on trees (context) - Rounds - 1970
31 Bottom-up and top-down tree transformations---a comparison (context) - Engelfriet - 1975
28 Information and Computation (context) - Comon, Haberstrau et al. - 1994
26 Basic paramodulation and decidable theories (context) - Nieuwenhuis - 1996
22 Tree transducers with external functions (context) - Fulop, Herrmann et al. - 1993
14 Modular tree transducers (context) - Engelfriet, Vogler - 1991
14 A complete unification algorithm for associativecommutative .. (context) - Stickel - 1975
12 Semantic unification for convergent systems - Mitra - 1994
9 Some results on equational unification (context) - Narendran, Otto - 1990
8 unification by means of tree tuple synchronized grammars (context) - Limet, Rety et al. - 1996
4 Unification and matching problems (context) - Siekmann - 1978
4 On two problems related to cancellativity (context) - Otto - 1986
4 New York (context) - Salomaa, Formal et al. - 1973
4 Diophantine representation of recursively enumerable predica.. (context) - Matijasevic - 1970
3 Operations which preserve definability in languages (context) - Ginsburg, Rose - 1963
1 IEEE Transactions on Electronic<F (context) - Ginsburg, abstract - 1962
1 ACM Transactions on Programming Languages<F (context) - Martelli, Montanari et al. - 1982
1 sequential machine maps (context) - Thatcher - 1970
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.