On Simultaneous Rigid E-Unification

On Simultaneous Rigid E-Unification (1997)

Cached

Download Links

[ftp.csd.uu.se]

by Margus Veanes

Citations:

11 - 2 self

BibTeX

@MISC{Veanes97onsimultaneous,
    author = {Margus Veanes},
    title = {On Simultaneous Rigid E-Unification},
    year = {1997}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

3376	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
1950	Computational Complexity - Papadimitriou - 1995
829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
723	Rewrite systems - Dershowitz, Jouannaud - 1990
485	The Complexity of Relational Query Languages - Vardi - 1982
448	Simple Word Problems in Universal Algebra - Knuth, Bendix - 1970
396	Model Theory - Chang - 1973
317	An efficient unification algorithm - Martelli, Montanari - 1982
307	A catalog of complexity classes - Johnson - 1990
247	Decidability of second-order theories and automata on infinite trees - Rabin - 1969
242	First-Order Logic - Smullyan - 1995
209	Investigations into logical deduction - Gentzen - 1969
184	D.: Finite automata and their decision problems - Rabin, Scott - 1959
160	L.J.: The equivalence problem for regular expressions with squaring requires exponential space - Meyer, Stockmeyer - 1972
157	Tree acceptors and some of their applications - Doner - 1970
156	On the structure of abstract algebras - Birkhoff - 1935
152	The problem of solvability of equations in a free semigroup - Makanin - 1977
144	Generalized finite automata theory with an application to a decision problem of 2nd-order logic - Thatcher, Wright - 1968
136	Linear unification - PATERSON, WEGMAN - 1978
130	Gedanken experiments on sequential machines - Moore - 1956
124	The undecidability of the second-order unification problem - Goldfarb - 1981
106	A variant of a recursively unsolvable problem - Post - 1946
102	Theorem proving via general matings - Andrews - 1981
90	Logic Programs as Types for Logic Programs - Frühwirth, Shapiro, et al. - 1991
69	Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
69	Deciding equivalence of finite tree automata - Seidl - 1990
66	Lower bounds for natural proof systems - Kozen - 1977
65	First Order Logic and Automated Theorem Proving - Fitting - 1990
64	Basic paramodulation and superposition - Bachmair, Ganzinger, et al. - 1992
59	Complexity of finitely presented algebras - Kozen - 1977
56	On the sequential nature of unification - Dwork, Kanellakis, et al. - 1984
56	M.J.: Economy of description by automata, grammars, and formal systems - Meyer, Fischer - 1971
55	Complete problems for deterministic polynomial time - Jones, Laaser - 1977
52	Complexity of matching problems - Benanav, Kapur, et al. - 1987
48	The theory of ground rewrite systems is decidable - Dauchet, Tison - 1990
48	Succinct representations of graphs - Galperin, Wigderson - 1983
48	The undecidability of the semiunification problem - Kfoury, Tiuryn, et al. - 1993
45	Basic Superposition is Complete - Nieuwenhuis, Rubio - 1992
45	An Algorithm for Reasoning about Equality - Shostak - 1978
42	Tree generating regular systems - Brainerd - 1969
41	Haskell overloading is DEXPTIME-complete - Seidl - 1994
40	An Improved Proof Procedure - Prawitz - 1960
37	Number of quantifiers is better than number of tape cells - Immerman - 1981
37	A note on succinct representations of graphs - Papadimitriou, Yannakakis - 1986
31	The Classical Decision Problem - Gurevich - 2001
30	An O(n log n)-space decision procedure for intuitionistic propositional logic - Hudelmaier - 1993
30	A simplified proof method for elementary logic - Kanger - 1983
30	bounds on Herbrand’s theorem - Statman, ‘Lower - 1979
29	Complexity of Makanin’s algorithm - Ko´scielski, Pacholski - 1996
29	Toward mechanical mathematics - Wang - 1960