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

DOI10.1007/s10472-010-9195-9zbMath1253.68301OpenAlexW2066651418MaRDI QIDQ693286

Antonio Hernando

Publication date: 7 December 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-010-9195-9

zbMATH Keywords

problem solversautomatic representation changesproblem spaces

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

On the existence of solutions in systems of linear Diophantine equations

Uses Software

• Walksat
• CPlan
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning from planner performance
• A system simulating representation change phenomena while problem solving
• Downward refinement and the efficiency of hierarchical problem solving
• Fast planning through planning graph analysis
• Changes of problem representation. Theory and experiments
• Showing the non-existence of solutions in systems of linear Diophantine equations
• Maximizing over multiple pattern databases speeds up heuristic search
• Towards a practical theory of reformulation for reasoning about physical systems
• REF-ARF: A system for solving problems stated as procedures
• A machine program for theorem-proving
• Planning as heuristic search
• Disjoint pattern database heuristics
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

This page was built for publication: New methods for proving the impossibility to solve problems through reduction of problem spaces