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

Takehide Soh; Daniel Le Berre; Stéphanie Roussel; Mutsunori Banbara; Naoyuki Tamura

Conference Papers Year : 2014

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

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

1
2

Takehide Soh

Function : Author

Kobe University

Daniel Le Berre

Function : Author
PersonId : 2191
IdHAL : daniel-le-berre
ORCID : 0000-0003-3221-9923
IdRef : 152104046

Centre de Recherche en Informatique de Lens

CV

Stéphanie Roussel

Function : Author

Centre de Recherche en Informatique de Lens

Mutsunori Banbara

Function : Author

Kobe University

Naoyuki Tamura

Function : Author

Kobe University

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

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

Last modification on : Wednesday, June 15, 2022-6:40:21 PM

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⟩

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share