Using Matching in Algebraic Equation Solving

Abstract

This paper describes the use of powerful algebraic matching techniques for applying rewrite rules In equation solving. A matcher Is presented that knows about the commutativlty and associativity of addition and multiplication, will provide defaults for missing summands and factors, and if necessary will solve algebraically for the value of pattern variables.able to derive the solutions to several of these hard problems. The PRESS solutions constitute a rational reconstruction of part of the history of algebra: we are not saying that this is how these solutions were first discovered, but that our program does show how they could have been discovered by a rational process of analysis of the problem, in terms of the tools available for its solution.

Cite

Text

Borning and Bundy. "Using Matching in Algebraic Equation Solving." International Joint Conference on Artificial Intelligence, 1981.

Markdown

[Borning and Bundy. "Using Matching in Algebraic Equation Solving." International Joint Conference on Artificial Intelligence, 1981.](https://mlanthology.org/ijcai/1981/borning1981ijcai-using/)

BibTeX

@inproceedings{borning1981ijcai-using,
  title     = {{Using Matching in Algebraic Equation Solving}},
  author    = {Borning, Alan and Bundy, Alan},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1981},
  pages     = {466-471},
  url       = {https://mlanthology.org/ijcai/1981/borning1981ijcai-using/}
}