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

DOI10.1007/S10472-010-9195-9MaRDI QIDQ693286zbMATH OpenOpenAlexFDO

Authors A. 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)

Recommendations

• Solving Satisfiability with Less Searching
• Resolution in solving graph problems
• The general problem solving algorithm and its implementation
• Experiments with reduction finding
• Heuristic search and related boundary value problems

Cites work

• scientific article; zbMATH DE number 525294 (Why is no real title available?)
• scientific article; zbMATH DE number 1903342 (Why is no real title available?)
• A machine program for theorem-proving
• A system simulating representation change phenomena while problem solving
• Changes of problem representation. Theory and experiments
• Disjoint pattern database heuristics
• Downward refinement and the efficiency of hierarchical problem solving
• Fast planning through planning graph analysis
• Learning from planner performance
• Maximizing over multiple pattern databases speeds up heuristic search
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Planning as heuristic search
• REF-ARF: A system for solving problems stated as procedures
• Showing the non-existence of solutions in systems of linear Diophantine equations
• The FF planning system: Fast plan generation through heuristic search
• The fast downward planning system
• Towards a practical theory of reformulation for reasoning about physical systems

Cited in

(2)

• On the existence of solutions in systems of linear Diophantine equations
• Mathematical Foundations of Computer Science 2003

Describes a project that uses

Uses Software

• Graphplan
• CPlan
• Walksat

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693286)