Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs

Lutz Plümer. Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. In Egon Börger, Hans Kleine Büning, Michael M. Richter, editors, CSL 88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings. Volume 385 of Lecture Notes in Computer Science, pages 254-271, Springer, 1988.

@inproceedings{Plumer88,
  title = {Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs},
  author = {Lutz Plümer},
  year = {1988},
  tags = {Prolog, termination},
  researchr = {https://researchr.org/publication/Plumer88},
  cites = {0},
  citedby = {0},
  pages = {254-271},
  booktitle = {CSL  88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings},
  editor = {Egon Börger and Hans Kleine Büning and Michael M. Richter},
  volume = {385},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-51659-X},
}