Two proof procedures of cardinality based language in propositional calculus - Université d'Artois Access content directly
Conference Papers Year : 1994

Two proof procedures of cardinality based language in propositional calculus

Domains

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, April 4, 2023-5:00:03 AM

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 CRIL IRENAV LAMPA LCPI LABOMAP LISPEN MSMP
24 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More