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

Autor:	ANTONIO HERNANDO ESTEBAN, ANTONIO HERNANDO GRANDE
Rok vydání:	2009
Předmět:	Reduction (complexity) Mathematical optimization Counting problem Artificial Intelligence Search algorithm Cutting stock problem Applied Mathematics Complex system Computational problem Impossibility Topology (chemistry) Mathematics
Zdroj:	Annals of Mathematics and Artificial Intelligence. 57:205-231
ISSN:	1573-7470 1012-2443
DOI:	10.1007/s10472-010-9195-9
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a6bc9185a38d1e7e0082c28ca599bd60 https://doi.org/10.1007/s10472-010-9195-9 Zobrazit plný text záznamu Full text from SpringerLink