<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-05219008</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-26T07:45:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints</title>
            <author role="aut">
              <persName>
                <forename type="first">Ryoga</forename>
                <surname>Ohashi</surname>
              </persName>
              <idno type="idhal" notation="numeric">1572894</idno>
              <idno type="halauthorid" notation="string">3724531-1572894</idno>
              <idno type="ORCID">https://orcid.org/0009-0003-7730-9401</idno>
              <affiliation ref="#struct-303713"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Takehide</forename>
                <surname>Soh</surname>
              </persName>
              <idno type="idhal" notation="numeric">1572895</idno>
              <idno type="halauthorid" notation="string">932597-1572895</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5897-9192</idno>
              <affiliation ref="#struct-303713"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Le Berre</surname>
              </persName>
              <email type="md5">9adf81725285c0aa384f0395c6d31d48</email>
              <email type="domain">cril.univ-artois.fr</email>
              <idno type="idhal" notation="string">daniel-le-berre</idno>
              <idno type="idhal" notation="numeric">2191</idno>
              <idno type="halauthorid" notation="string">4511-2191</idno>
              <idno type="IDREF">https://www.idref.fr/152104046</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3221-9923</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=cecXnbMAAAAJ&amp;hl=fr</idno>
              <affiliation ref="#struct-90448"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hidetomo</forename>
                <surname>Nabeshima</surname>
              </persName>
              <idno type="idhal" notation="numeric">1572896</idno>
              <idno type="halauthorid" notation="string">570256-1572896</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3752-2518</idno>
              <affiliation ref="#struct-161295"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mutsunori</forename>
                <surname>Banbara</surname>
              </persName>
              <idno type="idhal" notation="numeric">1572897</idno>
              <idno type="halauthorid" notation="string">932595-1572897</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5388-727X</idno>
              <affiliation ref="#struct-472208"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Katsumi</forename>
                <surname>Inoue</surname>
              </persName>
              <email type="md5">1b151db17a2ac2c93100ff27e0abbda8</email>
              <email type="domain">nii.ac.jp</email>
              <idno type="idhal" notation="numeric">925928</idno>
              <idno type="halauthorid" notation="string">567664-925928</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2717-9122</idno>
              <affiliation ref="#struct-6501"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Naoyuki</forename>
                <surname>Tamura</surname>
              </persName>
              <idno type="idhal" notation="numeric">1572898</idno>
              <idno type="halauthorid" notation="string">932598-1572898</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5466-1010</idno>
              <affiliation ref="#struct-303713"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Daniel</forename>
                <surname>Le Berre</surname>
              </persName>
              <email type="md5">9adf81725285c0aa384f0395c6d31d48</email>
              <email type="domain">cril.univ-artois.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-08-22 11:01:28</date>
              <date type="whenModified">2026-02-19 17:52:02</date>
              <date type="whenReleased">2025-08-22 11:01:28</date>
              <date type="whenProduced">2025-08-12</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102443">
                <persName>
                  <forename>Daniel</forename>
                  <surname>Le Berre</surname>
                </persName>
                <email type="md5">9adf81725285c0aa384f0395c6d31d48</email>
                <email type="domain">cril.univ-artois.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05219008</idno>
            <idno type="halUri">https://univ-artois.hal.science/hal-05219008</idno>
            <idno type="halBibtex">ohashi:hal-05219008</idno>
            <idno type="halRefHtml">&lt;i&gt;28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)&lt;/i&gt;, Aug 2025, Glasgow, United Kingdom. &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.SAT.2025.24"&gt;&amp;#x27E8;10.4230/LIPIcs.SAT.2025.24&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025), Aug 2025, Glasgow, United Kingdom. &amp;#x27E8;10.4230/LIPIcs.SAT.2025.24&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-ARTOIS">Université d'Artois</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="CRIL" corresp="UNIV-ARTOIS">Centre de recherche en informatique de Lens</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ryoga</forename>
                    <surname>Ohashi</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1572894</idno>
                  <idno type="halauthorid" notation="string">3724531-1572894</idno>
                  <idno type="ORCID">https://orcid.org/0009-0003-7730-9401</idno>
                  <affiliation ref="#struct-303713"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Takehide</forename>
                    <surname>Soh</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1572895</idno>
                  <idno type="halauthorid" notation="string">932597-1572895</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5897-9192</idno>
                  <affiliation ref="#struct-303713"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Le Berre</surname>
                  </persName>
                  <email type="md5">9adf81725285c0aa384f0395c6d31d48</email>
                  <email type="domain">cril.univ-artois.fr</email>
                  <idno type="idhal" notation="string">daniel-le-berre</idno>
                  <idno type="idhal" notation="numeric">2191</idno>
                  <idno type="halauthorid" notation="string">4511-2191</idno>
                  <idno type="IDREF">https://www.idref.fr/152104046</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3221-9923</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=cecXnbMAAAAJ&amp;hl=fr</idno>
                  <affiliation ref="#struct-90448"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hidetomo</forename>
                    <surname>Nabeshima</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1572896</idno>
                  <idno type="halauthorid" notation="string">570256-1572896</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3752-2518</idno>
                  <affiliation ref="#struct-161295"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mutsunori</forename>
                    <surname>Banbara</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1572897</idno>
                  <idno type="halauthorid" notation="string">932595-1572897</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5388-727X</idno>
                  <affiliation ref="#struct-472208"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Katsumi</forename>
                    <surname>Inoue</surname>
                  </persName>
                  <email type="md5">1b151db17a2ac2c93100ff27e0abbda8</email>
                  <email type="domain">nii.ac.jp</email>
                  <idno type="idhal" notation="numeric">925928</idno>
                  <idno type="halauthorid" notation="string">567664-925928</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2717-9122</idno>
                  <affiliation ref="#struct-6501"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Naoyuki</forename>
                    <surname>Tamura</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1572898</idno>
                  <idno type="halauthorid" notation="string">932598-1572898</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5466-1010</idno>
                  <affiliation ref="#struct-303713"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">Axe : Contraintes</idno>
                <title level="m">Leibniz International Proceedings in Informatics</title>
                <meeting>
                  <title>28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)</title>
                  <date type="start">2025-08-12</date>
                  <date type="end">2025-08-15</date>
                  <settlement>Glasgow</settlement>
                  <country key="GB">United Kingdom</country>
                </meeting>
                <imprint>
                  <publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisher>
                  <biblScope unit="volume">341</biblScope>
                  <date type="datePub">2025-08-07</date>
                </imprint>
              </monogr>
              <idno type="doi">10.4230/LIPIcs.SAT.2025.24</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Computing methodologies → Discrete space search</term>
                <term xml:lang="en">CEGAR</term>
                <term xml:lang="en">SAT Encoding</term>
                <term xml:lang="en">Hamiltonian Cycle Problem</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, we propose an enhancement to the SAT-based counterexample-guided abstraction refinement (CEGAR) approach for solving the Hamiltonian Cycle Problem (HCP). Many SAT-based methods for HCP have been proposed, including a CEGAR-based method that repeatedly solves a relaxed version of HCP strengthened by counterexamples. However, when the counterexample space - represented by the full set of subcycle partitions - is large, it becomes difficult to find a solution. To address this, we introduce cut-set constraints in the refinement step, replacing traditional subcycle blocking constraints. Our evaluation shows that these cut-set constraints achieve equal or better reduction in the counterexample space, making it easier to find valid solutions. We further assessed performance using all 1001 instances from the FHCP challenge set and confirmed that the proposed method solved 937 instances within 1800 seconds, outperforming both the existing eager and CEGAR encodings (which solved at most 666 instances). This demonstrates the effectiveness of incorporating cut-set constraints into SAT-based CEGAR approaches.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-303713" status="VALID">
          <idno type="ROR">https://ror.org/03tgsfw79</idno>
          <orgName>Kobe University</orgName>
          <desc>
            <address>
              <country key="JP"/>
            </address>
            <ref type="url">http://www.kobe-u.ac.jp/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-90448" status="VALID">
          <idno type="IdRef">08345585X</idno>
          <idno type="RNSR">200812835W</idno>
          <orgName>Centre de Recherche en Informatique de Lens</orgName>
          <orgName type="acronym">CRIL</orgName>
          <date type="start">2008-01-01</date>
          <desc>
            <address>
              <addrLine>Faculté Jean Perrin Rue Jean Souvraz - SP 18 - 62307 LENS CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.cril.univ-artois.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR8188" active="#struct-56711" type="direct"/>
            <relation name="UMR8188" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-161295" status="VALID">
          <idno type="ROR">https://ror.org/059x21724</idno>
          <orgName>University of Yamanashi</orgName>
          <desc>
            <address>
              <addrLine>Kofu Campus 4-4-37, Takeda, Kofu, Yamanashi, 400-8510 Japan</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">http://www.yamanashi.ac.jp</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-472208" status="VALID">
          <idno type="ISNI">000000010943978X</idno>
          <idno type="ROR">https://ror.org/04chrp450</idno>
          <orgName>Nagoya University</orgName>
          <desc>
            <address>
              <addrLine>Furo-cho, Chikusa-ku, Nagoya, 464-8601, Japan</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">http://en.nagoya-u.ac.jp</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-6501" status="VALID">
          <idno type="ROR">https://ror.org/04ksd4g47</idno>
          <orgName>National Institute of Informatics</orgName>
          <orgName type="acronym">NII</orgName>
          <desc>
            <address>
              <addrLine>2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">http://www.nii.ac.jp/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-56711" status="VALID">
          <idno type="IdRef">034634894</idno>
          <idno type="ISNI">000000012364777X</idno>
          <idno type="ROR">https://ror.org/053x9s498</idno>
          <orgName>Université d'Artois</orgName>
          <orgName type="acronym">UA</orgName>
          <date type="start">1992-09-01</date>
          <desc>
            <address>
              <addrLine>9 rue du Temple - BP 10665 - 62030 Arras cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-artois.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>