A Computational Study of DP with Symmetry on Hard Satisfiability Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 1994

A Computational Study of DP with Symmetry on Hard Satisfiability Problems

(1)
1
Lakhdar Saïs
Centre de Recherche en Informatique de Lens

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-03301147

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

Last modification on : Wednesday, October 20, 2021-9:58:21 AM

Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-03301147 , version 1

Cite

Lakhdar Saïs. A Computational Study of DP with Symmetry on Hard Satisfiability Problems. Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods, 1994, Seattle, USA, Unknown Region. pp.52-56. ⟨hal-03301147⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-ARTOIS CNRS CRIL
5 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More