Skip to Main content Skip to Navigation
Journal articles

Dealing with Satisfiability and n-ary CSPs in a logical framework

Belaïd Benhamou 1 Lionel Paris 1 Pierre Siegel 1
1 LSIS - Laboratoire des Sciences de l'Information et des Systèmes
Abstract : no abstract
Document type :
Journal articles
Complete list of metadata
https://hal-amu.archives-ouvertes.fr/hal-01479548
Contributor : William Domingues Vinhas Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 8:39:00 PM
Last modification on : Friday, October 22, 2021 - 3:34:12 AM

Identifiers

  • HAL Id : hal-01479548, version 1

Collections

UNIV-AMU | LSIS | LSIS-INCA | CNRS | UNIV-TLN | LIS-LAB | UNIV-HESAM | ARTS-ET-METIERS-SCIENCES-ET-TECHNOLOGIES

Citation

Belaïd Benhamou, Lionel Paris, Pierre Siegel. Dealing with Satisfiability and n-ary CSPs in a logical framework. Journal of Automated Reasoning, Springer Verlag, 2012, 48 (3), pp.391-417. ⟨hal-01479548⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

57