Minimum Proof Graphs and Fastest-Cut-First Search Heuristics

Timothy Furtak, Michael Buro. Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. In Craig Boutilier, editor, IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. pages 492-498, 2009. [doi]

@inproceedings{FurtakB09,
  title = {Minimum Proof Graphs and Fastest-Cut-First Search Heuristics},
  author = {Timothy Furtak and Michael Buro},
  year = {2009},
  url = {http://ijcai.org/papers09/Papers/IJCAI09-089.pdf},
  tags = {graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/FurtakB09},
  cites = {0},
  citedby = {0},
  pages = {492-498},
  booktitle = {IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009},
  editor = {Craig Boutilier},
}