Pages that link to "Item:Q1923820"
From MaRDI portal
The following pages link to Using hints to increase the effectiveness of an automated reasoning program: Case studies (Q1923820):
Displayed 21 items.
- Learning-assisted theorem proving with millions of lemmas (Q485842) (← links)
- Double-negation elimination in some propositional logics (Q813082) (← links)
- Fast and slow enigmas and parental guidance (Q831937) (← links)
- Axiomatizing the skew Boolean propositional calculus (Q877820) (← links)
- Shortest axiomatizations of implicational S4 and S5 (Q1430904) (← links)
- Proofs as schemas and their heuristic use (Q1583854) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- A Wos Challenge Met (Q2102924) (← links)
- A posthumous contribution by Larry Wos: excerpts from an unpublished column (Q2102925) (← links)
- Guiding an automated theorem prover with neural rewriting (Q2104548) (← links)
- Towards finding longer proofs (Q2142073) (← links)
- Learning theorem proving components (Q2142080) (← links)
- Finding proofs in Tarskian geometry (Q2362499) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- Lemmatization for Stronger Reasoning in Large Theories (Q2964472) (← links)
- MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance (Q3541722) (← links)
- Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction (Q4913865) (← links)
- Toward a Procedure for Data Mining Proofs (Q4913870) (← links)
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description) (Q5049022) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)