Belaid Benhamou, Lakhdar Sais, Pierre Siegel. Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. 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 71-82, Springer, 1994.
@inproceedings{BenhamouSS94,
title = {Two Proof Procedures for a Cardinality Based Language in Propositional Calculus},
author = {Belaid Benhamou and Lakhdar Sais and Pierre Siegel},
year = {1994},
tags = {rule-based},
researchr = {https://researchr.org/publication/BenhamouSS94},
cites = {0},
citedby = {0},
pages = {71-82},
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},
}