The following pages link to HR (Q22353):
Displaying 21 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Conjecture synthesis for inductive theories (Q438543) (← links)
- Applying SAT solving in classification of finite algebras (Q862393) (← links)
- The transformational creativity hypothesis (Q867497) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Automatic construction and verification of isotopy invariants (Q928664) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- Bridging the gap between argumentation theory and the philosophy of mathematics (Q2271079) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Proof planning with multiple strategies (Q2389631) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Mathematical applications of inductive logic programming (Q2433178) (← links)
- Dealing with algebraic expressions over a field in Coq using Maple (Q2456560) (← links)
- Automated conjecture making in number theory using HR, Otter and Maple (Q2456561) (← links)
- User interaction with the Matita proof assistant (Q2462635) (← links)
- (Q2837831) (← links)
- Proof-Pattern Recognition and Lemma Discovery in ACL2 (Q2870142) (← links)
- Bridging the Gap Between Argumentation Theory and the Philosophy of Mathematics (Q2950042) (← links)
