General E-unification with Eager Variable Elimination and a Nice Cycle Rule

@article{Morawska2007GeneralEW,
  title={General E-unification with Eager Variable Elimination and a Nice Cycle Rule},
  author={Barbara Morawska},
  journal={Journal of Automated Reasoning},
  year={2007},
  volume={39},
  pages={77-106}
}
We present a goal-directed E-unification procedure with eager Variable Elimination and a new rule, Cycle, for the case of collapsing equations – that is, equations of the type x ≈ v where x ∈Var(v). Cycle replaces Variable Decomposition (or the so-called Root Imitation) and thus removes possibility of some obviously unnecessary infinite paths of inferences in the E-unification procedure. We prove that, as in other approaches, such inferences into variable positions in our goal-directed… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…