Dewar, Alan D.Cleary, John G.2008-05-202008-05-201990-03-01http://hdl.handle.net/1880/46513We present an intelligent backtracking algorithm with high accuracy and low overhead, especially for certain classes of algorithms. Information is associated with each variable binding and with each proof-tree node. Performance results indicate that our approach can attain a similar accuracy, but at a lower cost, when compared with other similar intelligent backtracking approaches.EngComputer Scienceunknown1990-381-0510.11575/PRISM/31266