HR
From MaRDI portal
Cited in
(40)- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Conjectures of TxGraffiti: independence, domination, and matchings
- Algorithmic introduction of quantified cuts
- Conjecture synthesis for inductive theories
- User interaction with the Matita proof assistant
- On the generation of quantified lemmas
- Automatic construction and verification of isotopy invariants
- Mathematical applications of inductive logic programming
- 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
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- INGRID
- IsaPlanner
- GrInvIn
- Graph
- AutoGraphiX
- Graffiti.pc
- GRAFFITI
- SicoTHEO
- MathWeb
- tptp2X
- GRAPH
- TIP
- MATHsAiD
- GraPHedron
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Bridging the gap between argumentation theory and the philosophy of mathematics
- Bridging the gap between argumentation theory and the philosophy of mathematics
- IsaCoSy
- 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
- A survey of automated conjectures in spectral graph theory
- Proof-pattern recognition and lemma discovery in ACL2
- Automated conjecture making in number theory using HR, Otter and Maple
This page was built for software: HR