A Reachability-Based Complexity Measure for Case-Based Reasoners

Devi Ganesan, Sutanu Chakraborti. A Reachability-Based Complexity Measure for Case-Based Reasoners. In Roman Barták, Keith W. Brawner, editors, Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, Sarasota, Florida, USA, May 19-22 2019. pages 341-346, AAAI Press, 2019. [doi]

@inproceedings{GanesanC19,
  title = {A Reachability-Based Complexity Measure for Case-Based Reasoners},
  author = {Devi Ganesan and Sutanu Chakraborti},
  year = {2019},
  url = {https://aaai.org/ocs/index.php/FLAIRS/FLAIRS19/paper/view/18191},
  researchr = {https://researchr.org/publication/GanesanC19},
  cites = {0},
  citedby = {0},
  pages = {341-346},
  booktitle = {Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, Sarasota, Florida, USA, May 19-22 2019},
  editor = {Roman Barták and Keith W. Brawner},
  publisher = {AAAI Press},
}