Experiment with an automatic theorem-prover having partial ordering inference rules
From MaRDI portal
Cited in
(6)- MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics
- Non-resolution theorem proving
- Automatic theorem proving in set theory
- A pragmatic approach to resolution-based theorem proving
- Str\(\dotplus\)ve and integers
- Refutational theorem proving using term-rewriting systems
This page was built for publication: Experiment with an automatic theorem-prover having partial ordering inference rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214440)