Matrix analysis
First-order logic and automated theorem proving
First-order logic and automated theorem proving
A proof theory for general unification
A proof theory for general unification
Semantic Analysis of Matrix Structures
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Abstract matrices in symbolic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Managing ambiguity in mathematical matrices
SBIM '07 Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling
Capturing abstract matrices from paper
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
| Hi-index | 0.00 |
In mathematical textbooks matrices are often represented as objects of indefinite size containing abbreviations. To make the knowledge implicitly given in these representations available in electronic form they have to be interpreted correctly. We present an algorithm that provides the interface between the textbook style representation of matrix expressions and their concrete interpretation as formal mathematical objects. Given an underspecified matrix containing ellipses and fill symbols, our algorithm extracts the semantic information contained. Matrices are interpreted as a collection of regions that can be interpolated with a particular term structure. The effectiveness of our procedure is demonstrated with an implementation in the computer algebra system Maple.