Abstract
We give a set of inference rules for E-unification, similar to the inference rules for Syntactic Mutation. If the E is finitely saturated by paramodulation, then we can block certain terms from further inferences. Therefore, E-unification is decidable in NP, as is also the case for Basic Narrowing. However, if we further restrict E, then our algorithm runs in quadratic time, whereas Basic Narrowing does not become polynomial, since it is still nondeterministic.
This work was supported by NSF grant number CCR-0098270 and ONR grant number N00014-01-1-0435.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. In Journal of Logic and Computation 4(3), 1–31, 1994.
L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation Vol. 121, No. 2 (1995) pp. 172–192.
H. Comon, M. Haberstrau and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and shallow theories. In Information and Computation 111(1), 154–191, 1994.
Q. Guo, P. Narendran and D. Wolfram. Unification and Matching modulo Nilpotence. In Proceedings 13th International Conference on Automated Deduction, Rutgers University, NJ, 1996.
J.-M. Hullot. Canonical forms and unification. In Proc. 5th Int. Conf. on Automated Deduction, LNCS, vol. 87, pp. 318–334, Berlin, 1980. Springer-Verlag.
F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, ed., Rewriting Techniques and Applications, 7th International Conference, RTA-96, LNCS, vol. 1103, Springer, 362–376, 1996.
F. Jacquemard, Ch. Meyer, Ch. Weidenbach. Unification in Extensions of Shallow Equational Theories. In T. Nipkow, ed., Rewriting Techniques and Applications, 9th International Conference, RTA-98, LNCS, vol. 1379, Springer, 76–90, 1998.
D. Kapur and P. Narendran. Matching, Unification, and Complexity. In SIGSAM Bulletin, 1987.
C. Kirchner. Computing unification algorithms. In Proceedings of the Fourth Symposium on Logic in Computer Science, Boston, 200–216, 1990.
D.E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In Computational Problems in Abstract Algebra, ed. J. Leech, 263–297, Pergamon Press, 1970.
S. Limet and P. Réty. E-unification by Means of Tree Tuple Synchronized Grammars. In Discrete Mathematics and Theoretical Computer Science, volume 1, pp. 69–98, 1997.
C. Lynch and B. Morawska. http://www.clarkson.edu/~clynch/papers/bsmfull.ps/, 2002.
R. Nieuwenhuis. Basic paramodulation and decidable theories. (Extended abstract), In Proceedings 11th IEEE Symposium on Logic in Computer Science, LICS’96, IEEE Computer Society Press, 473–482, 1996.
R. Nieuwenhuis and A. Rubio. Basic Superposition is Complete. In Proc. European Symposium on Programming, Rennes, France (1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, C., Morawska, B. (2002). Basic Syntactic Mutation. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_37
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive