David Basin. A term equality problem equivalent to graph isomorphism. Information Processing Letters, 51:61 -- 66, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Graph Isomorphism Problem - Fortin (1996) (13 citations) (Correct)
.... and regular graphs [9] These results are not terribly surprising since many of these graph classes exhibit a large amount of regularity, which is one of the factors that makes graph isomorphism difficult (see Section 4) The term equality problem was also shown to be isomorphism complete by Basin [7]. In this problem, we are given two terms which can have functions which are associative, commutative, or both, and can have commutative variable binding operators. We then must decide if the two terms are equal; a special case of this problem is deciding if two predicate calculus terms are equal. ....
D. Basin. A term equality problem equivalent to graph isomorphism. Information Processing Letters, 51:61--66, 1994.
A Comparison of two Energy Minimization Methods for Graph.. - Abdulrahim, Misra (Correct)
....[19] some times called exact graph matching) Graph isomorphism is considered to have a stronger notion of graph matching compared to other types of graph matching. The exact complexity of this problem is still open; though it is clearly in NP, it has neither been proven NP complete nor in P [5, 2]. This type of graph matching is often not appropriate for real applications of pattern recognition. Real images tend to have distortions and degradations. Trying to search for a previously stored image that must be isomorphic to a given distorted one is nearly impossible. Graph isomorphism in ....
David A. Basin. A term equality problem equivalent to graph isomorphism. Information Processing Letters, 51:61--66, 1994.
Generalized Rewriting in Type Theory - Basin Self-citation (Basin) (Correct)
....solution to an important theorem proving problem. It dramatically raises the level of user system interaction; moreover, it provides a foundation for building high level proof procedures such as decision procedures based on equational reasoning and term normalization. Examples are given in [2, 3]. One area for improvement and future research is rewrite efficiency. Our approach essentially justifies rewrites twice: once when using the lemma database to construct rewrites, and again when the tactics are executed. An alternative is to build proofs directly; however, this approach is wasteful ....
David Basin. A term equality problem equivalent to graph isomorphism. Information Processing Letters, 51:61 -- 66, 1994.
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