Checkable Proofs for First-Order Theorem Proving

Giles Reger, Martin Suda 0001. Checkable Proofs for First-Order Theorem Proving. In Giles Reger, Dmitriy Traytel, editors, ARCADE 2017, 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, Gothenburg, Sweden, 6th August 2017. Volume 51 of EPiC Series in Computing, pages 55-63, EasyChair, 2017. [doi]

@inproceedings{Reger017,
  title = {Checkable Proofs for First-Order Theorem Proving},
  author = {Giles Reger and Martin Suda 0001},
  year = {2017},
  url = {http://www.easychair.org/publications/paper/5W2B},
  researchr = {https://researchr.org/publication/Reger017},
  cites = {0},
  citedby = {0},
  pages = {55-63},
  booktitle = {ARCADE 2017, 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, Gothenburg, Sweden, 6th August 2017},
  editor = {Giles Reger and Dmitriy Traytel},
  volume = {51},
  series = {EPiC Series in Computing},
  publisher = {EasyChair},
}