Abstract
A vector-product space is a component-free representation of the common three-dimensional Cartesian vector space. The components of the vectors are invisible and formally inaccessible, although expressions for the components could be constructed. Expressions that have been built from the scalar and vector products can be simplified using a rule-based system. In order to develop and specify the system, an axiomatic system for a vector-product space is given. In addition, a brief description is given of an implementation in Aldor. The present work provides simplification functionality which overcomes difficulties encountered in earlier packages. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Liang, S., & Jeffrey, D. J. (2007). Rule-based simplification in vector-product spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4573 LNAI, pp. 116–127). Springer Verlag. https://doi.org/10.1007/978-3-540-73086-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
