We 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.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at email@example.com