• Corpus ID: 212592144

Solving the Pixel Puzzle under Answer Set Programming

@inproceedings{Khatib2016SolvingTP,
  title={Solving the Pixel Puzzle under Answer Set Programming},
  author={Omar El Khatib},
  year={2016}
}
In this work, we present a representation and an automatic solving of a pixel puzzle using answer set programming. The puzzle has been proven previously to be NP-complete. Pixel puzzle consists of blank rectangular grid of any size with clues on the left and top of the grid. The rectangular grid is subdivided into unit cells. The objective is to color a consecutive (or block) cells in the grid with black color in each row and column that corresponds to the clues. Answer Set Programming (ASP… 

Figures and Tables from this paper

Modelling Assembly Line Balancing Problem in Answer Set Programming

  • Omar El-Khatib
  • Computer Science
    2016 International Conference on Computational Science and Computational Intelligence (CSCI)
  • 2016
It turns out that, although Answer Set Programming greatly simplifies the problem statement, it is comparable in efficiency to specialized programs.

References

SHOWING 1-10 OF 41 REFERENCES

Solving Nonograms by combining relaxations

Solving Japanese puzzles with logical rules and depth first search algorithm

Experimental results show that the proposed puzzle solving algorithm can solve Japanese puzzles successfully, and the processing speed is significantly faster than that of DFS.

Solving Japanese Puzzles with Heuristics

This paper presents ad-hoc heuristics which use the information in rows, columns, and puzzle's constraints to obtain the solution of the puzzle, and extends the best heuristic developed for black and white puzzles to solving color Japanese puzzles.

An efficient algorithm for solving nonograms

This paper uses the chronological backtracking algorithm to solve those undetermined cells and logical rules to improve the search efficiently, and can determine that a nonogram has no solution.

NP-completeness Results for NONOGRAM via Parsimonious Reductions

This paper proposes one approach for showing the NP-completeness of ASP for a given NP problem X, and shows a parsimonious reduction from Y to X that has the following additional property: given a solution for an instance for Y, a solutions for the corresponding instance for X is computable in polynomial time.

Stable models and an alternative logic programming paradigm

It is demonstrated that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics.

Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs

The intent is to study how well recent advances in propositional satisfiability (SAT) and thus Answer Set Programming (ASP) can be exploited to automate the design of flexible multiprocessor systems.

The DLV system for knowledge representation and reasoning

The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.