Using geometric rewrite rules for solving geometric problems symbolically

DOI10.1016/0304-3975(93)90324-MzbMATH Open0795.68175MaRDI QIDQ685375FDOQ685375

Authors: Beat Brüderlin 

Publication date: 25 October 1993

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

Recommendations

• scientific article; zbMATH DE number 194597
• Proving geometry theorems with rewrite rules
• scientific article; zbMATH DE number 1303337
• Geometric constraint solving with geometric transformation
• Solving geometry problems using a combination of symbolic and numerical reasoning

zbMATH Keywords

computer aided designcongruence relationcompass and ruler constructionrewrite rule system

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automated reasoning in geometry theorem proving with Prolog
• A note on syntactic symmetry and the manipulation of formal systems by machine
• Title not available (Why is that?)
• Algebraic simplification
• Title not available (Why is that?)
• Basic principles of mechanical theorem proving in elementary geometries
• A refutational approach to geometry theorem proving
• Title not available (Why is that?)

Cited In (6)

• Proving geometry theorems with rewrite rules
• Title not available (Why is that?)
• Finding the Symbolic Solution of a Geometric Problem Through Numerical Computations
• Solving geometry problems using a combination of symbolic and numerical reasoning
• A formalization of geometric constraint systems and their decomposition
• Tolerances in geometric constraint problems

This page was built for publication: Using geometric rewrite rules for solving geometric problems symbolically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685375)