New methods for proving the impossibility to solve problems through reduction of problem spaces

  • Authors:

  • Antonio Hernando

  • Affiliations:

  • Departamento de Sistemas Inteligentes Aplicados, Escuela Universitaria de Informática, Universidad Politécnica de Madrid, Madrid, Spain

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Problem solvers are computational systems which make use of different search algorithms for solving problems. Sometimes, while employing such search algorithms, problem solvers may prove to be inefficient and take too great an effort so as to showing that the problem has no solution. For such cases, in this paper we explain a technique which provides a quick proof that finding a solution is actually impossible. This technique results in reducing the number and simplifying the topology of the states which shape a problem space. Hence, we show and prove efficient new techniques intended to find such reductions which may result to be very useful for many problems.