On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs

Shujun Zhang, Naoki Nishida 0001. On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs. In Michael Hanus, Atsushi Igarashi, editors, Functional and Logic Programming - 16th International Symposium, FLOPS 2022, Kyoto, Japan, May 10-12, 2022, Proceedings. Volume 13215 of Lecture Notes in Computer Science, pages 262-281, Springer, 2022. [doi]

@inproceedings{ZhangN22-3,
  title = {On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs},
  author = {Shujun Zhang and Naoki Nishida 0001},
  year = {2022},
  doi = {10.1007/978-3-030-99461-7_15},
  url = {https://doi.org/10.1007/978-3-030-99461-7_15},
  researchr = {https://researchr.org/publication/ZhangN22-3},
  cites = {0},
  citedby = {0},
  pages = {262-281},
  booktitle = {Functional and Logic Programming - 16th International Symposium, FLOPS 2022, Kyoto, Japan, May 10-12, 2022, Proceedings},
  editor = {Michael Hanus and Atsushi Igarashi},
  volume = {13215},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-99461-7},
}