Resolution, Refinements, and Search Strategies: A Comparative Study
From MaRDI portal
Cited in
(10)- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- Unrestricted resolution versus N-resolution
- The rue theorem-proving system: The complete set of LIM+ challenge problems
- Controlled integration of the cut rule into connection tableau calculi
- Jack Minker --- A profile
- Inference approach based on Petri nets
- A pragmatic approach to resolution-based theorem proving
- Partheo: A high-performance parallel theorem prover
- Complete inference via knowledge Petri nets and resolution rules
- Stepping stones in the TPTP world
This page was built for publication: Resolution, Refinements, and Search Strategies: A Comparative Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096460)