Recongo: bounded combinatorial reconfiguration with answer set programming

DOI10.1007/978-3-031-43619-2_20MaRDI QIDQ6545541zbMATH OpenFDO

Authors Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub

Publication date 29 May 2024

zbMATH Keywords

answer set programmingcombinatorial reconfigurationindependent set reconfigurationmulti-shot ASP solving

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Hamiltonian cycle reconfiguration with answer set programming
• Introduction to reconfiguration
• Using contracted solution graphs for solving reconfiguration problems
• Using contracted solution graphs for solving reconfiguration problems
• Editorial: Special issue on reconfiguration problems

Cites work

• A dichotomy theorem for circular colouring reconfiguration
• Complexity of Hamiltonian cycle reconfiguration
• Complexity of independent set reconfigurability problems
• Finding paths between 3-colorings
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Introduction to reconfiguration
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programs with stable model semantics as a constraint programming paradigm
• On the Parameterized Complexity for Token Jumping on Graphs
• On the complexity of reconfiguration problems
• Reconfiguration of cliques in a graph
• Reconfiguration of list edge-colorings in a graph
• Shortest reconfiguration paths in the solution space of Boolean formulas
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
• The complexity of change
• The complexity of dominating set reconfiguration

Cited in

(2)

• Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis
• Hamiltonian cycle reconfiguration with answer set programming

This page was built for publication: Recongo: bounded combinatorial reconfiguration with answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545541)