HR

swMATH10392MaRDI QIDQ22353FDOQ22353

Author name not available (Why is that?)

Cited In (25)

• Conjectures of TxGraffiti: independence, domination, and matchings
• Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
• Algorithmic introduction of quantified cuts
• Conjecture synthesis for inductive theories
• User interaction with the Matita proof assistant
• On the generation of quantified lemmas
• Mathematical applications of inductive logic programming
• Automatic construction and verification of isotopy invariants
• Dealing with algebraic expressions over a field in Coq using Maple
• Applying SAT solving in classification of finite algebras
• The transformational creativity hypothesis
• Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
• Category-based co-generation of seminal concepts and results in algebra and number theory: containment-division and Goldbach rings
• Title not available (Why is that?)
• Bridging the gap between argumentation theory and the philosophy of mathematics
• Bridging the gap between argumentation theory and the philosophy of mathematics
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• Proof planning with multiple strategies
• The problem of \(\Pi_{2}\)-cut-introduction
• Automated conjecturing. III. Property-relations conjectures
• Automated Reasoning
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
• Proof-pattern recognition and lemma discovery in ACL2
• A survey of automated conjectures in spectral graph theory
• Automated conjecture making in number theory using HR, Otter and Maple

This page was built for software: HR