The following pages link to (Q3006508):
Displaying 24 items.
- HR (Q22353) (← links)
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Conjecture synthesis for inductive theories (Q438543) (← 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)
- 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)
- A fully automatic theorem prover with human-style output (Q2362206) (← 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)
- Automated conjecture making in number theory using HR, Otter and Maple (Q2456561) (← links)
- User interaction with the Matita proof assistant (Q2462635) (← links)
- Bridging the Gap Between Argumentation Theory and the Philosophy of Mathematics (Q2950042) (← links)
- Machine synthesis of mathematical theorems (Q3485887) (← links)
- (Q3677198) (← links)
- CATEGORY-BASED CO-GENERATION OF SEMINAL CONCEPTS AND RESULTS IN ALGEBRA AND NUMBER THEORY: CONTAINMENT-DIVISION AND GOLDBACH RINGS (Q5229614) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
- Inductive Logic Programming (Q5897178) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
