Two Proof Procedures for a Cardinality Based Language in Propositional Calculus

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.