Resolution, Refinements, and Search Strategies: A Comparative Study

DOI10.1109/TC.1976.1674697zbMATH Open0331.68052OpenAlexW1525644138MaRDI QIDQ4096460FDOQ4096460

Authors: Gerald A. Wilson, Jack Minker 

Publication date: 1976

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1976.1674697

Mathematics Subject Classification ID

Cited In (9)

• Complete inference via knowledge Petri nets and resolution rules
• Unrestricted resolution versus N-resolution
• A pragmatic approach to resolution-based theorem proving
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• Controlled integration of the cut rule into connection tableau calculi
• Jack Minker --- A profile
• Inference approach based on Petri nets
• The rue theorem-proving system: The complete set of LIM+ challenge problems
• Partheo: A high-performance parallel theorem prover

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)