Matches in SemOpenAlex for { <https://semopenalex.org/work/W3083663179> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W3083663179 endingPage "602" @default.
- W3083663179 startingPage "585" @default.
- W3083663179 abstract "SAT solvers have achieved remarkable successes in solving various combinatorial problems. Nevertheless, it remains a challenge to find an efficient SAT encoding for the Hamiltonian Cycle Problem (HCP), which is one of the most well-known NP-complete problems. A central issue in encoding HCP into SAT is how to prevent sub-cycles, and one well-used technique is to map vertices to different positions. The HCP can be modeled as a single-agent path-finding problem. If the agent occupies vertex i at time t, and occupies vertex j at time $$t+1$$ , then vertex j’s position must be the successor of vertex i’s. This paper compares three encodings for the successor function, namely, a unary encoding that uses a Boolean variable for each vertex-time pair, an optimized binary adder encoding that uses a special incrementor with no carry variables, and a LFSR encoding that uses a linear-feedback-shift register. This paper also proposes a preprocessing technique that rules out a position from consideration for a vertex and a time if the agent cannot occupy the vertex at the time. Our study has surprisingly revealed that, with optimization and preprocessing, the binary adder encoding is a clear winner: it solved some instances of the knight’s tour problem that had been beyond reach for eager encoding approaches, and performed the best on the HCP instances used in the 2019 XCSP competition." @default.
- W3083663179 created "2020-09-11" @default.
- W3083663179 creator A5008511813 @default.
- W3083663179 date "2020-01-01" @default.
- W3083663179 modified "2023-09-26" @default.
- W3083663179 title "In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem" @default.
- W3083663179 cites W1534902470 @default.
- W3083663179 cites W1538681263 @default.
- W3083663179 cites W1570066695 @default.
- W3083663179 cites W1571087346 @default.
- W3083663179 cites W1590910789 @default.
- W3083663179 cites W1975129671 @default.
- W3083663179 cites W1988318499 @default.
- W3083663179 cites W2012978749 @default.
- W3083663179 cites W2013473339 @default.
- W3083663179 cites W2018094844 @default.
- W3083663179 cites W2036486897 @default.
- W3083663179 cites W2048644716 @default.
- W3083663179 cites W2049287714 @default.
- W3083663179 cites W2063292248 @default.
- W3083663179 cites W2091138122 @default.
- W3083663179 cites W2105761964 @default.
- W3083663179 cites W2158651374 @default.
- W3083663179 cites W2159875930 @default.
- W3083663179 cites W2237679549 @default.
- W3083663179 cites W2335478831 @default.
- W3083663179 cites W2395113865 @default.
- W3083663179 cites W2605289564 @default.
- W3083663179 cites W2750143525 @default.
- W3083663179 cites W27905376 @default.
- W3083663179 cites W2807604366 @default.
- W3083663179 cites W2950058198 @default.
- W3083663179 cites W2963870440 @default.
- W3083663179 doi "https://doi.org/10.1007/978-3-030-58475-7_34" @default.
- W3083663179 hasPublicationYear "2020" @default.
- W3083663179 type Work @default.
- W3083663179 sameAs 3083663179 @default.
- W3083663179 citedByCount "4" @default.
- W3083663179 countsByYear W30836631792021 @default.
- W3083663179 countsByYear W30836631792022 @default.
- W3083663179 countsByYear W30836631792023 @default.
- W3083663179 crossrefType "book-chapter" @default.
- W3083663179 hasAuthorship W3083663179A5008511813 @default.
- W3083663179 hasConcept C104737047 @default.
- W3083663179 hasConcept C11413529 @default.
- W3083663179 hasConcept C114614502 @default.
- W3083663179 hasConcept C118615104 @default.
- W3083663179 hasConcept C125411270 @default.
- W3083663179 hasConcept C132525143 @default.
- W3083663179 hasConcept C154945302 @default.
- W3083663179 hasConcept C33923547 @default.
- W3083663179 hasConcept C41008148 @default.
- W3083663179 hasConcept C48372109 @default.
- W3083663179 hasConcept C78023250 @default.
- W3083663179 hasConcept C80444323 @default.
- W3083663179 hasConcept C80899671 @default.
- W3083663179 hasConcept C86524685 @default.
- W3083663179 hasConcept C94375191 @default.
- W3083663179 hasConceptScore W3083663179C104737047 @default.
- W3083663179 hasConceptScore W3083663179C11413529 @default.
- W3083663179 hasConceptScore W3083663179C114614502 @default.
- W3083663179 hasConceptScore W3083663179C118615104 @default.
- W3083663179 hasConceptScore W3083663179C125411270 @default.
- W3083663179 hasConceptScore W3083663179C132525143 @default.
- W3083663179 hasConceptScore W3083663179C154945302 @default.
- W3083663179 hasConceptScore W3083663179C33923547 @default.
- W3083663179 hasConceptScore W3083663179C41008148 @default.
- W3083663179 hasConceptScore W3083663179C48372109 @default.
- W3083663179 hasConceptScore W3083663179C78023250 @default.
- W3083663179 hasConceptScore W3083663179C80444323 @default.
- W3083663179 hasConceptScore W3083663179C80899671 @default.
- W3083663179 hasConceptScore W3083663179C86524685 @default.
- W3083663179 hasConceptScore W3083663179C94375191 @default.
- W3083663179 hasLocation W30836631791 @default.
- W3083663179 hasOpenAccess W3083663179 @default.
- W3083663179 hasPrimaryLocation W30836631791 @default.
- W3083663179 hasRelatedWork W10951979 @default.
- W3083663179 hasRelatedWork W14770828 @default.
- W3083663179 hasRelatedWork W41163 @default.
- W3083663179 hasRelatedWork W6151009 @default.
- W3083663179 hasRelatedWork W6933560 @default.
- W3083663179 hasRelatedWork W6973530 @default.
- W3083663179 hasRelatedWork W80570 @default.
- W3083663179 hasRelatedWork W849468 @default.
- W3083663179 hasRelatedWork W1967665 @default.
- W3083663179 hasRelatedWork W405553 @default.
- W3083663179 isParatext "false" @default.
- W3083663179 isRetracted "false" @default.
- W3083663179 magId "3083663179" @default.
- W3083663179 workType "book-chapter" @default.