Proceedings

On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them

Download BibTeX Cite

Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Search Techniques. Pages 304-307.

Abstract

The paper discusses necessity of structuring a search tree. A theorem is stated that the cl.-~ procedure is the only search reduction procedure for non-structured minimay problems. For a class of problems structure in some way a non-trivial search reduction method is described.

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, and M. V. Donskoy. 1975. On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75. IJCAI, 304–307. https://ijcai.org/proceedings/1975/46
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards