Using geometric rewrite rules for solving geometric problems symbolically

DOI10.1016/0304-3975(93)90324-MzbMath0795.68175MaRDI QIDQ685375

Beat Brüderlin

Publication date: 25 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computer aided designcongruence relationcompass and ruler constructionrewrite rule system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Related Items

Tolerances in geometric constraint problems ⋮ A formalization of geometric constraint systems and their decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automated reasoning in geometry theorem proving with Prolog
• Basic principles of mechanical theorem proving in elementary geometries
• A refutational approach to geometry theorem proving
• A note on syntactic symmetry and the manipulation of formal systems by machine