New methods for proving the impossibility to solve problems through reduction of problem spaces
type: Item
instance of: scholarly article
title: New methods for proving the impossibility to solve problems through reduction of problem spaces
zbMATH Open document ID: 1253.68301
author: A. Hernando
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6114096
zbMATH Keywords: problem spaces
zbMATH Keywords: automatic representation changes
zbMATH Keywords: problem solvers
describes a project that uses: Walksat
describes a project that uses: CPlan
describes a project that uses: Graphplan
MaRDI profile type: Publication
full work available at URL: s10472-010-9195-9
OpenAlex ID: W2066651418
cites work: Downward refinement and the efficiency of hierarchical problem solving
cites work: Planning as heuristic search
cites work: Fast planning through planning graph analysis
cites work: Towards a practical theory of reformulation for reasoning about physical systems
cites work: A machine program for theorem-proving
cites work: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
cites work: REF-ARF: A system for solving problems stated as procedures
cites work: Changes of problem representation. Theory and experiments
cites work: Q3624014
cites work: A system simulating representation change phenomena while problem solving
cites work: Showing the non-existence of solutions in systems of linear Diophantine equations
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Maximizing over multiple pattern databases speeds up heuristic search
cites work: Q4284894
cites work: Disjoint pattern database heuristics
cites work: Learning from planner performance
cites work: Q4804883
DOI: 10.1007/S10472-010-9195-9
description: scientific article; zbMATH DE number 6114096