We give a set of inference rules for E-unification, similar to the inference rules for Syntactic Mutation. If the E is finitelysaturated 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. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Lynch, C., & Morawska, B. (2002). Basic syntactic mutation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2392, 471–485. https://doi.org/10.1007/3-540-45620-1_37
Mendeley helps you to discover research relevant for your work.