Dominating Set Reconfiguration with Answer Set Programming

The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in gene...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming Jg. 24; H. 4; S. 755 - 771
Hauptverfasser: KATO, MASATO, BANBARA, MUTSUNORI, SCHAUB, TORSTEN, SOH, TAKEHIDE, TAMURA, NAOYUKI
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cambridge, UK Cambridge University Press 01.07.2024
Schlagworte:
ISSN:1471-0684, 1475-3081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.
AbstractList The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.
Author TAMURA, NAOYUKI
KATO, MASATO
SCHAUB, TORSTEN
SOH, TAKEHIDE
BANBARA, MUTSUNORI
Author_xml – sequence: 1
  givenname: MASATO
  surname: KATO
  fullname: KATO, MASATO
  email: kato.masato@nagoya-u.jp
  organization: Graduate School of Informatics, Nagoya University, Nagoya, Aichi, Japan (e-mails: kato.masato@nagoya-u.jp, banbara@nagoya-u.jp)
– sequence: 2
  givenname: MUTSUNORI
  orcidid: 0000-0002-5388-727X
  surname: BANBARA
  fullname: BANBARA, MUTSUNORI
  email: kato.masato@nagoya-u.jp
  organization: Graduate School of Informatics, Nagoya University, Nagoya, Aichi, Japan (e-mails: kato.masato@nagoya-u.jp, banbara@nagoya-u.jp)
– sequence: 3
  givenname: TORSTEN
  orcidid: 0000-0002-7456-041X
  surname: SCHAUB
  fullname: SCHAUB, TORSTEN
  email: torsten@cs.uni-potsdam.de
  organization: Institut für Informatik und Computational Science, Universität Potsdam, Potsdam, Germany (e-mail: torsten@cs.uni-potsdam.de)
– sequence: 4
  givenname: TAKEHIDE
  surname: SOH
  fullname: SOH, TAKEHIDE
  email: soh@lion.kobe-u.ac.jp
  organization: Kobe University, Kobe, Hyogo, Japan (e-mails: soh@lion.kobe-u.ac.jp, tamura@kobe-u.ac.jp)
– sequence: 5
  givenname: NAOYUKI
  surname: TAMURA
  fullname: TAMURA, NAOYUKI
  email: soh@lion.kobe-u.ac.jp
  organization: Kobe University, Kobe, Hyogo, Japan (e-mails: soh@lion.kobe-u.ac.jp, tamura@kobe-u.ac.jp)
BookMark eNp1kE9LAzEQxYNUsK1-AG8Lnldnkmyy661Uq0JBsXpesmmybnGTmmwpfnu3f8CDeJrhzfu9gTciA-edIeQS4RoB5c0CuUQQOaccAGhBT8iwl7KUQY6D_Y7p7n5GRjGuAFAwyofk9s63jVNd4-pkYbrk1WjvbFNvQq95l2yb7iOZuLg1YX9_Cb4Oqu2Z-pycWvUZzcVxjsn77P5t-pjOnx-eppN5qimnXUoLwwrK-FLIfEkRJbVaGpsLrLS0WFTKSKGNrDKpBGirsQIlFAXUyCwHNiZXh9x18F8bE7ty5TfB9S9LhlmWUSmB9i48uHTwMQZjy3VoWhW-S4RyV1H5p6KeYUdGtVVolrX5jf6f-gGIh2ju
ContentType Journal Article
Copyright The Author(s), 2025. Published by Cambridge University Press
The Author(s), 2025. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s), 2025. Published by Cambridge University Press
– notice: The Author(s), 2025. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID IKXGN
AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068424000292
DatabaseName Cambridge University Press Wholly Gold Open Access Journals
CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList Computer Science Database

CrossRef
Database_xml – sequence: 1
  dbid: IKXGN
  name: Cambridge University Press Wholly Gold Open Access Journals
  url: http://journals.cambridge.org/action/login
  sourceTypes: Publisher
– sequence: 2
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 771
ExternalDocumentID 10_1017_S1471068424000292
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IKXGN
IOEEP
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c242t-29e39234d678d21172fc7ef861bc7f19bae76ce7b57a60cfc1b0a6a201c13f403
IEDL.DBID IKXGN
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001397984200016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Fri Jul 25 09:09:32 EDT 2025
Sat Nov 29 04:58:38 EST 2025
Thu Jan 16 03:38:36 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords combinatorial reconfiguration
dominating set reconfiguration
answer set programming
Language English
License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c242t-29e39234d678d21172fc7ef861bc7f19bae76ce7b57a60cfc1b0a6a201c13f403
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5388-727X
0000-0002-7456-041X
OpenAccessLink https://www.cambridge.org/core/product/identifier/S1471068424000292/type/journal_article
PQID 3155527702
PQPubID 43613
PageCount 17
ParticipantIDs proquest_journals_3155527702
crossref_primary_10_1017_S1471068424000292
cambridge_journals_10_1017_S1471068424000292
PublicationCentury 2000
PublicationDate 20240700
2024-07-00
20240701
PublicationDateYYYYMMDD 2024-07-01
PublicationDate_xml – month: 07
  year: 2024
  text: 20240700
PublicationDecade 2020
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2024
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References 2011; 412
2017; 31
2014; 5
2009; 42
2005; 343
2021; 301
2016; 639
2016; 32
2016; 651
2019; 19
2009; 410
2011; 67
2014; 30
2018; 11
2009; 38
2012; 439
References_xml – volume: 412
  start-page: 1054
  issue: 12-14
  year: 2011
  end-page: 1065
  article-title: On the complexity of reconfiguration problems
  publication-title: Theoretical Computer Science
– volume: 651
  start-page: 37
  year: 2016
  end-page: 49
  article-title: The complexity of dominating set reconfiguration
  publication-title: Theoretical Computer Science
– volume: 11
  start-page: 52
  issue: 4
  year: 2018
  article-title: Introduction to reconfiguration
  publication-title: Algorithms
– volume: 31
  start-page: 2185
  issue: 3
  year: 2017
  end-page: 2200
  article-title: Shortest reconfiguration paths in the solution space of boolean formulas
  publication-title: SIAM Journal on Discrete Mathematics
– volume: 42
  start-page: 225204
  issue: 22
  year: 2009
  article-title: A new kempe invariant and the (non)-ergodicity of the wang-swendsen-kotecký algorithm
  publication-title: Journal of Physics A: Mathematical and Theoretical
– volume: 19
  start-page: 27
  issue: 1
  year: 2019
  end-page: 82
  article-title: Multi-shot ASP solving with clingo
  publication-title: Theory and Practice of Logic Programming
– volume: 410
  start-page: 5215
  issue: 50
  year: 2009
  end-page: 5226
  article-title: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
  publication-title: Theoretical Computer Science
– volume: 343
  start-page: 72
  issue: 1-2
  year: 2005
  end-page: 96
  article-title: Pspace-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
  publication-title: Theoretical Computer Science
– volume: 32
  start-page: 1182
  issue: 4
  year: 2016
  end-page: 1195
  article-title: Reconfiguration of dominating sets
  publication-title: Journal of Combinatorial Optimization
– volume: 11
  start-page: 140
  issue: 9
  year: 2018
  article-title: Complexity of hamiltonian cycle reconfiguration
  publication-title: Algorithms
– volume: 38
  start-page: 2330
  issue: 6
  year: 2009
  end-page: 2355
  article-title: The connectivity of boolean satisfiability: Computational and structural dichotomies
  publication-title: SIAM Journal on Computing
– volume: 5
  start-page: 102
  issue: 1
  year: 2014
  end-page: 111
  article-title: Distribution loss minimization with guaranteed error bound
  publication-title: IEEE Transactions Smart Grid
– volume: 301
  start-page: 6
  year: 2021
  end-page: 18
  article-title: Dominating sets reconfiguration under token sliding
  publication-title: Discrete Applied Mathematics
– volume: 67
  start-page: 69
  issue: 1
  year: 2011
  end-page: 82
  article-title: Finding paths between 3-colorings
  publication-title: Journal of Graph Theory
– volume: 30
  start-page: 609
  issue: 3
  year: 2014
  end-page: 617
  article-title: The k-dominating graph
  publication-title: Graphs and Combinatorics
– volume: 639
  start-page: 1
  year: 2016
  end-page: 13
  article-title: A dichotomy theorem for circular colouring reconfiguration
  publication-title: Theoretical Computer Science
– volume: 439
  start-page: 9
  year: 2012
  end-page: 15
  article-title: Complexity of independent set reconfigurability problems
  publication-title: Theoretical Computer Science
SSID ssj0016324
Score 2.3340878
Snippet The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Index Database
Publisher
StartPage 755
SubjectTerms Combinatorial analysis
Declarative programming
Graph coloring
Mathematical programming
Original Article
Reconfiguration
Social networks
Wireless networks
SummonAdditionalLinks – databaseName: Computer Science Database
  dbid: K7-
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgcODCeIrBQD1wQkS0Sdq0XNAETEigaRIP7ValaYJ26cbawd8n7mPThLQL16SpKsfxZ8dfbYBLH2En4RHRJrQBiqI-kSZUJKVhaATzTFTW6f54EYNBOBpFw_rCLa9plY1NLA11OlF4R37DLPD5VAiX3k2_CHaNwuxq3UJjE7Y8Sj3U82dBFlkELEVe_l0kkN0T8iariSWjcRDHkEPpUsyELmsrrGLUqokucaff_u8X78Fu7XE6vUpF9mFDZwfQbro5OPXhPoTbhwnSYpAG7bzqwsHANDPjz3mlIw7e2Dq9LP_BRXZ-WDG77JrPI3jvP77dP5G6swJRFpILQiNt_SLGUwtVqQ0BBTVK2N0KvEQJ40WJ1CJQWiS-kIGrjPISVwbSOgvKY4a77Bha2STTJ-BYl9CXQhgpOeOcyYQHynclYyqx7pSMOnC9kGtcn488rrhlIv6zDR24akQfT6t6G-se7jaSX756KfbT9dNnsEOth1Jxb7vQKmZzfQ7b6rsY57OLUpN-AWnFy2Y
  priority: 102
  providerName: ProQuest
Title Dominating Set Reconfiguration with Answer Set Programming
URI https://www.cambridge.org/core/product/identifier/S1471068424000292/type/journal_article
https://www.proquest.com/docview/3155527702
Volume 24
WOSCitedRecordID wos001397984200016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT8IwFH5B8OBF_BlRJDt4Mi5sbbdu3lBBDWYhooZ4WbquJVwGgaH_vu1-oGhi4sHLDtvape91fV_7vn4FOHN02ImIbwrpqQkKR47JpMfNGHmepNiWfqbT_fJAg8AbjfxBBUblXhhNq1xpHGSZ_Ox8tFkuf9qexDmHRszbQ1uNq5ZOIxH9W_uorRct24ULwsLwG1BTCAahKtTu-6PbYJVh0DLl2c4jqpk_HikznlpO-nvNX3UX1uPX-vCdxaRe_f9aswPbBU41OvmdXaiIZA_q5RkQRjEk7MPlzVSTaTR52hiK1NDT2UROxsu8Zxl6ndfoJIt3XUg9H-R8MFVmfADPve7T9Z1ZnMdgchXIUxP5QqEpTGIV4GI1caRIcqp87NoRp9L2IyaoywWNHMpci0tuRxZzmYIY3MaSWPgQqsk0EUdgKCDpMEolYwQTgllEXO5YDGMeKRDG_AZcrOwWFkZYhDkjjYY_jNWA89Ip4SxX6fjt5Wbpts-qscJVDqLUQsd_-_QJbCGFc3IGbxOq6XwpTmGTv6WTxbwFtatuMHhsFb2vBRt9aqrrwHn9APXO5Zo
linkProvider Cambridge University Press
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB7qA_TiW3ybg17EYLK7ySaCSPFBi7UUfCBe4ma7K15Sta3FP-VvdCZpLCJ48-B1N7skmffOtzMAOwGZnVTErrERBiiaBa6ykXbbLIqs5L6N8zrdtw3ZbEZ3d3GrAh_lXRiCVZY6MVfU7Y6mM_IDjoYvYFJ67Pj5xaWuUZRdLVtoFGxxYd4HGLJ1j-qnSN9dxs7Prk9q7rCrgKvRHPVcFhv0Cbhoo5puY_gjmdUS3zT0Uy2tH6fKyFAbmQZShZ622k89FSo0lNrnVngc9x2DCSEwWEL5aQX3X1kLKn2e32aShCaKRJlFpRLVNEhjhNn0GGVeR7UcvtvE7yYht3Pns__tD83BzNCjdqqFCMxDxWQLMFt2q3CGymsRDk87BPshmLdzZXoOBd6ZfXrsFzLg0Im0U826A1qE860CuYZrHpfg5k--YBnGs05mVsBBlzdQUlqlBBeCq1SEOvAU5zpFd1HFq7D_RcdkKP_dpMDOyeQH2VdhryR18lzUE_nt4Y2S0qOtR2Re-316G6Zq15eNpFFvXqzDNENvrMAZb8B477VvNmFSv_Weuq9bORc78PDXTPEJzl8o0A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dominating+Set+Reconfiguration+with+Answer+Set+Programming&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=KATO%2C+MASATO&rft.au=BANBARA%2C+MUTSUNORI&rft.au=SCHAUB%2C+TORSTEN&rft.au=SOH%2C+TAKEHIDE&rft.date=2024-07-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=24&rft.issue=4&rft.spage=755&rft.epage=771&rft_id=info:doi/10.1017%2FS1471068424000292&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068424000292
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon