Hamiltonian Cycle Reconfiguration with Answer Set Programming-Reference-Cited by-同舟云学术

Hamiltonian Cycle Reconfiguration with Answer Set Programming

Published:2023 Issue: Volume: Page:262-277
ISSN:0302-9743
Container-title:Logics in Artificial Intelligence
language:
Short-container-title:

Author:

Hirate Takahiro,Banbara Mutsunori^ORCID,Inoue Katsumi^ORCID,Lu Xiao-Nan^ORCID,Nabeshima Hidetomo^ORCID,Schaub Torsten^ORCID,Soh Takehide^ORCID,Tamura Naoyuki^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-43619-2_19

Reference32 articles.

1. Audemard, G., Boussemart, F., Lecoutre, C., Piette, C., Roussel, O.: XCSP$${}^{\text{3 }}$$ and its ecosystem. Constraints 25(1–2), 47–69 (2020)

2. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);J Bomanson,2015

4. Bonsma, P.S., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoret. Comput. Sci. 410(50), 5215–5226 (2009)

5. Brewster, R.C., McGuinness, S., Moore, B.R., Noel, J.A.: A dichotomy theorem for circular colouring reconfiguration. Theoret. Comput. Sci. 639, 1–13 (2016)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis;Lecture Notes in Computer Science;2024

2. Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming;Logics in Artificial Intelligence;2023