Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation

Miquel Bofill, Albert Rubio. Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. In Andrei Voronkov, editor, Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings. Volume 2392 of Lecture Notes in Computer Science, pages 456-470, Springer, 2002. [doi]

@inproceedings{BofillR02,
  title = {Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation},
  author = {Miquel Bofill and Albert Rubio},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2392/23920456.htm},
  tags = {completeness},
  researchr = {https://researchr.org/publication/BofillR02},
  cites = {0},
  citedby = {0},
  pages = {456-470},
  booktitle = {Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings},
  editor = {Andrei Voronkov},
  volume = {2392},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43931-5},
}