Abstract
This article is the twenty-third of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria for deciding which e1uality unit clauses to adjoin with regard to CPU time and may affect refutation completeness. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, circuit design, program verification, and the world of puzzles.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
