Dealing with Satisfiability and n-ary CSPs in a logical framework
Abstract
no abstract
Journal Articles
Journal of Automated Reasoning
Year : 2012
William Domingues Vinhas : Connect in order to contact the contributor
https://hal-amu.archives-ouvertes.fr/hal-01479548
Submitted on : Tuesday, February 28, 2017-8:39:00 PM
Last modification on : Friday, October 22, 2021-3:34:12 AM
Dates and versions
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⟩
Collections
58
View
0
Download