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