Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure

Jörg H. Siekmann, Gert Smolka. Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure. In Jörg H. Siekmann, editor, GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, January 26-31, 1981, Proceedings. Volume 47 of Informatik-Fachberichte, pages 199-200, Springer, 1981.

@inproceedings{SiekmannS81:0,
  title = {Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure},
  author = {Jörg H. Siekmann and Gert Smolka},
  year = {1981},
  tags = {graph-rewriting, rewriting, rewriting strategies},
  researchr = {https://researchr.org/publication/SiekmannS81%3A0},
  cites = {0},
  citedby = {0},
  pages = {199-200},
  booktitle = {GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, January 26-31, 1981, Proceedings},
  editor = {Jörg H. Siekmann},
  volume = {47},
  series = {Informatik-Fachberichte},
  publisher = {Springer},
  isbn = {3-540-10859-9},
}