Dealing with Satisfiability and n-ary CSPs in a logical framework - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2012

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

(1) , (1) , (1)
1

Abstract

no abstract
Not file

Dates and versions

hal-01479548 , version 1 (28-02-2017)

Identifiers

  • HAL Id : hal-01479548 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More