Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis

J. B. Wells, Boris Yakobowski. Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. In Sandro Etalle, editor, Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers. Volume 3573 of Lecture Notes in Computer Science, pages 262-277, Springer, 2004. [doi]

@inproceedings{WellsY04,
  title = {Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis},
  author = {J. B. Wells and Boris Yakobowski},
  year = {2004},
  doi = {10.1007/11506676_17},
  url = {http://dx.doi.org/10.1007/11506676_17},
  tags = {rule-based, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/WellsY04},
  cites = {0},
  citedby = {0},
  pages = {262-277},
  booktitle = {Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers},
  editor = {Sandro Etalle},
  volume = {3573},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26655-0},
}