Matches in SemOpenAlex for { <https://semopenalex.org/work/W2398348717> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2398348717 endingPage "18" @default.
- W2398348717 startingPage "12" @default.
- W2398348717 abstract "The Maze Generation problem has been presented as a benchmark for the Second Answer Set Programming Competition. We prove that the problem is NP–complete and identify relevant classes of unsatisfiable instances. The Maze Generation (MG) problem has been presented as a benchmark for the Second Answer Set Programming (ASP) Competition1. The problem has been placed in the NP category, which contains problems in NP for which an algorithm in P is unknown. Here, we prove that the problem is in fact complete for the complexity class NP. In addition, we identify classes of unsatisfiable instances that are efficiently recognizable. We start the discussion by defining a maze. Definition 1 (Maze). A maze is an m × n grid, in which each cell is empty or a wall and two distinct cells on the edges are indicated as entrance and exit, satisfying the following conditions: (1) Each cell in an edge of the grid is a wall, except entrance and exit that are empty; (2) There is no 2 × 2 square of empty cells or walls; (3) If two walls are on a diagonal of a 2× 2 square, then not both of their common neighbors are empty; (4) No wall is completely surrounded by empty cells; (5) There is a path from the entrance to every empty cell. The MG problem is the decision problem concerning the possibility to build a maze by extending a partially fixed grid. Definition 2 (Maze Generation problem). An instance of the MG problem is a structure of the form 〈G, I,O,W,E〉, where G is a set of cells (pairs of integers) representing a grid, I and O are two distinct cells of G, W and E are subsets of G. The MG problem is then defined as follows: Given a structure 〈G, I,O,W,E〉, is there a maze of the same size of G such that I and O are entrance and exit, respectively, each cell in W is a wall and each cell in E is empty?" @default.
- W2398348717 created "2016-06-24" @default.
- W2398348717 creator A5039882261 @default.
- W2398348717 date "2009-01-01" @default.
- W2398348717 modified "2023-09-26" @default.
- W2398348717 title "The Maze Generation Problem is NP-complete." @default.
- W2398348717 hasPublicationYear "2009" @default.
- W2398348717 type Work @default.
- W2398348717 sameAs 2398348717 @default.
- W2398348717 citedByCount "1" @default.
- W2398348717 crossrefType "proceedings-article" @default.
- W2398348717 hasAuthorship W2398348717A5039882261 @default.
- W2398348717 hasConcept C114614502 @default.
- W2398348717 hasConcept C126255220 @default.
- W2398348717 hasConcept C130367717 @default.
- W2398348717 hasConcept C13280743 @default.
- W2398348717 hasConcept C135692309 @default.
- W2398348717 hasConcept C177264268 @default.
- W2398348717 hasConcept C185798385 @default.
- W2398348717 hasConcept C187691185 @default.
- W2398348717 hasConcept C199360897 @default.
- W2398348717 hasConcept C205649164 @default.
- W2398348717 hasConcept C2524010 @default.
- W2398348717 hasConcept C2777735758 @default.
- W2398348717 hasConcept C33923547 @default.
- W2398348717 hasConcept C41008148 @default.
- W2398348717 hasConceptScore W2398348717C114614502 @default.
- W2398348717 hasConceptScore W2398348717C126255220 @default.
- W2398348717 hasConceptScore W2398348717C130367717 @default.
- W2398348717 hasConceptScore W2398348717C13280743 @default.
- W2398348717 hasConceptScore W2398348717C135692309 @default.
- W2398348717 hasConceptScore W2398348717C177264268 @default.
- W2398348717 hasConceptScore W2398348717C185798385 @default.
- W2398348717 hasConceptScore W2398348717C187691185 @default.
- W2398348717 hasConceptScore W2398348717C199360897 @default.
- W2398348717 hasConceptScore W2398348717C205649164 @default.
- W2398348717 hasConceptScore W2398348717C2524010 @default.
- W2398348717 hasConceptScore W2398348717C2777735758 @default.
- W2398348717 hasConceptScore W2398348717C33923547 @default.
- W2398348717 hasConceptScore W2398348717C41008148 @default.
- W2398348717 hasLocation W23983487171 @default.
- W2398348717 hasOpenAccess W2398348717 @default.
- W2398348717 hasPrimaryLocation W23983487171 @default.
- W2398348717 hasRelatedWork W1562717528 @default.
- W2398348717 hasRelatedWork W196900508 @default.
- W2398348717 hasRelatedWork W1981329550 @default.
- W2398348717 hasRelatedWork W2123056394 @default.
- W2398348717 hasRelatedWork W2140747265 @default.
- W2398348717 hasRelatedWork W2140790988 @default.
- W2398348717 hasRelatedWork W2281692433 @default.
- W2398348717 hasRelatedWork W2397265210 @default.
- W2398348717 hasRelatedWork W2412751461 @default.
- W2398348717 hasRelatedWork W254098917 @default.
- W2398348717 hasRelatedWork W2725236087 @default.
- W2398348717 hasRelatedWork W2796973897 @default.
- W2398348717 hasRelatedWork W2805761617 @default.
- W2398348717 hasRelatedWork W2950140953 @default.
- W2398348717 hasRelatedWork W3104335265 @default.
- W2398348717 hasRelatedWork W3122000620 @default.
- W2398348717 hasRelatedWork W318401295 @default.
- W2398348717 hasRelatedWork W55054594 @default.
- W2398348717 hasRelatedWork W1516914758 @default.
- W2398348717 hasRelatedWork W2223626923 @default.
- W2398348717 isParatext "false" @default.
- W2398348717 isRetracted "false" @default.
- W2398348717 magId "2398348717" @default.
- W2398348717 workType "article" @default.