One Binary Horn Clause is Enough

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz. One Binary Horn Clause is Enough. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 21-32, Springer, 1994.

@inproceedings{DevienneLRW94,
  title = {One Binary Horn Clause is Enough},
  author = {Philippe Devienne and Patrick Lebègue and Jean-Christophe Routier and Jörg Würtz},
  year = {1994},
  researchr = {https://researchr.org/publication/DevienneLRW94},
  cites = {0},
  citedby = {0},
  pages = {21-32},
  booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
  editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
  volume = {775},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57785-8},
}