Recongo: bounded combinatorial reconfiguration with answer set programming
From MaRDI portal
Publication:6545541
DOI10.1007/978-3-031-43619-2_20MaRDI QIDQ6545541FDOQ6545541
Authors: Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub
Publication date: 29 May 2024
Recommendations
answer set programmingcombinatorial reconfigurationindependent set reconfigurationmulti-shot ASP solving
Cites Work
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programs with stable model semantics as a constraint programming paradigm
- The complexity of change
- Finding paths between 3-colorings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- On the complexity of reconfiguration problems
- On the Parameterized Complexity for Token Jumping on Graphs
- Reconfiguration of list edge-colorings in a graph
- Reconfiguration of cliques in a graph
- The complexity of dominating set reconfiguration
- Introduction to reconfiguration
- Complexity of Hamiltonian cycle reconfiguration
- Shortest reconfiguration paths in the solution space of Boolean formulas
Cited In (2)
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)