Two proof procedures of cardinality based language in propositional calculus - Archive ouverte HAL Access content directly
Conference Papers Year : 1994

Two proof procedures of cardinality based language in propositional calculus

(1) , (2)
1
2

Domains

Computer Science [cs] Artificial Intelligence [cs.AI]

Fabien DELORME  : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03301139

Submitted on : Tuesday, July 27, 2021-1:08:39 PM

Last modification on : Tuesday, February 7, 2023-2:45:15 PM

Not file

Dates and versions

hal-03301139 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03301139 , version 1

Cite

Belaid Benhamou, Lakhdar Saïs. Two proof procedures of cardinality based language in propositional calculus. Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science - STACS'94, 1994, Caen, France. pp.71-82. ⟨hal-03301139⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-ARTOIS UNIV-TLN CNRS UNIV-AMU LIS-LAB ARTS-ET-METIERS-SCIENCES-ET-TECHNOLOGIES CRIL
22 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More