Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem - Université d'Artois Access content directly
Conference Papers Year : 2014

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem

Domains

Artificial Intelligence [cs.AI]

Fabien DELORME  : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03300801

Submitted on : Tuesday, July 27, 2021-12:08:08 PM

Last modification on : Friday, March 24, 2023-2:53:22 PM

Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-03300801 , version 1

Cite

Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura. Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. 14th European Conference on Logics in Artificial Intelligence (JELIA'14), 2014, Madeira, Portugal. pp.684-693. ⟨hal-03300801⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-ARTOIS CNRS CRIL
22 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More