Abstract
A geometrical approach to algebraic reasoning is presented. To every system of algebraic equations in the language of planar ternary rings is associated a system of equations in the language of a first order theory with equality equivalent to projective geometry. A narrowing-based mechanism computes the solutions of this geometrical system corresponding to the solutions of the original algebraic problem. As a corollary, unification in planar ternary rings is finitary and constitutes a decidable class of problems for which a type conformal algorithm exists.
Preview
Unable to display preview. Download preview PDF.
References
P. Balbiani, V. Dugat, L. Fariñas del Cerro, A. Lopez: Eléments de géométrie mécanique. Hermès, Paris, France, 1994
P. Balbiani, L. Fariñas del Cerro. Affine geometry of collinearity and conditional term rewriting. In: Ecole de printemps d'informatique théorique, Font Romeu, France, mai 1993, Proceedings. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany
P. Balbiani, A. Lopez: Simplification des figures de la géométrie affine plane d'incidence. In: Neuvième congrès reconnaissance des formes et intelligence artificielle, Paris, France, 11–14 janvier 1994
L. Blumenthal: A Modern View of Geometry. Freeman, San Francisco, California, 1961
A. Bockmayr, S. Krischer, A. Werner: An optimal narrowing strategy for general canonical systems. In J.-L. Rémy, M. Rusinowitch (editors): Conditional Term Rewriting Systems, 3rd International Workshop, Pontà -Mousson, France, July 1992, Proceedings. Lecture Notes in Computer Science 656, Springer-Verlag, Berlin, Germany
B. Buchberger: Gröbner bases: an algorithmic method in polynomial ideal theory. In N. Bose (editor): Recent Trends in Multidimensional Systems Theory. Reidel, Dordrecht, Netherlands, 1985
B. Buchberger, G. Collins, B. Kutzler: Algebraic methods for geometric reasoning. In: Ann. Rev. Comput. Sci., volume 3, pp. 85–119 (1988)
H.-J. Bürckert: Matching — a special case of unification ? In C. Kirchner (editor): Unification, pages 125–138. Academic Press, London, Great Britain, 1990
S.-C. Chou: Mechanical Geometry Theorem Proving. Reidel, Dordrecht, Netherlands, 1988
N. Dershowitz, J.-P. Jouannaud: Rewrite systems. In J. van Leeuwen (editor): Handbook of Theoretical Computer Science, volume B, Formal Models and Semantics, pp. 243–320. Elsevier, Amsterdam, Netherlands, 1990
H. Ganzinger: A completion procedure for conditional equations. In S. Kaplan, J.-P. Jouannaud (editors): Conditional term Rewriting Systems, 1st International Workshop, Orsay, France, July 1987, Proceedings, pp. 62–83. Lecture Notes in Computer Science 308, Springer-Verlag, Berlin, Germany, 1988
A. Herold: Narrowing techniques applied to idempotent unification. Technical report SR-86-16, Universität Kaiserslautern
J.-M. Hullot: Canonical forms and unification. In: Fifth International Conference on Automated Deduction, Les Arcs, France, Proceedings, pp. 318–334. Lecture Notes in Computer Science 87, Springer-Verlag, Berlin, Germany, 1980
H. Hußmann: Unification in conditional equational theories. Proceedings of the European Conference on Computer Algebra, pp. 543–553. Lecture Notes in Computer Science 204, Springer-Verlag, Berlin, Germany, 1985
S. Kaplan: Simplifying conditional term rewriting systems: unification, termination and confluence. In: Journal of Symbolic Computation, volume 4, number 3, pp. 295–334, 1987
S. Kaplan: Positive/negative conditional rewriting. In S. Kaplan and J.P. Jouannaud (editors): Conditional Term Rewriting Systems, 1st International Workshop, Orsay, France, July 1987, Proceedings, pp. 129–143. Lecture Notes in Computer Science 308, Springer Verlag, Berlin, Germany, 1988
S. Kaplan, J.-L. Rémy: Completion algorithms for conditional rewriting systems. In H. Aït-Kaci and M. Nivat (editors): Resolution of Equations in Algebraic Structures, volume 2, Rewriting Techniques, pp. 141–170. Academic Press, San Diego, California, 1989
M. Martelli, U. Montanari: An efficient unification algorithm. In: ACM Transactions on Programming Languages and Systems, volume 4, number 2, pp. 258–282 (1982)
A. Middeldorp, E. Hamoen: Counterexamples to completeness results for basic narrowing. In H. Kirchner, G. Levi (editors): Algebraic and Logic Programming, Third International ALP Conference, Volterra, Italy, September 1992, Proceedings, pp. 244–258. Lecture Notes in Computer Science 632, Springer-Verlag, Berlin, Germany, 1992
M. Rusinowitch: Démonstration automatique: techniques de réécriture. InterEditions, Paris, France, 1989
W. Snyder: A Proof Theory for General Unification. Birkhäuser, Boston, Massachusetts, 1991
W.-T. Wu: Basic principles of mechanical theorem proving in elementary geometries. In: Journal of Automated Reasoning, volume 2, number 3, pp. 221–252 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Balbiani, P. (1994). Equation solving in projective planes and planar ternary rings. In: Levi, G., RodrÃguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-58431-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58431-5
Online ISBN: 978-3-540-48791-3
eBook Packages: Springer Book Archive