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

DOI10.1007/S10472-010-9195-9zbMATH Open1253.68301OpenAlexW2066651418MaRDI QIDQ693286FDOQ693286

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

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

zbMATH Keywords

problem solversautomatic representation changesproblem spaces

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

Uses Software

• Walksat
• CPlan
• Graphplan

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)