A framework for analysing state-abstraction methods

DOI10.1016/J.ARTINT.2021.103608zbMATH Open1486.68175OpenAlexW3207048625MaRDI QIDQ2060741FDOQ2060741

Authors: Peter Jonsson, Christer Bäckström 

Publication date: 13 December 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2021.103608

Recommendations

• Merge-and-shrink: a compositional theory of transformations of factored transition systems
• Merge-and-Shrink Abstraction
• Graph abstraction in real-time heuristic search
• The computational complexity of avoiding spurious states in state space abstraction
• scientific article; zbMATH DE number 139761

zbMATH Keywords

heuristic searchrefinementcombinatorial searchaction planningstate abstractionhierarchical abstraction

Mathematics Subject Classification ID

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

Cites Work

• Counterexample-guided abstraction refinement for symbolic model checking
• The computational complexity of propositional STRIPS planning
• Generalized best-first search strategies and the optimality of A*
• Title not available (Why is that?)
• Weighted \(A^*\) search - unifying view and application
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• Succinct representations of graphs
• Heuristic search. Theory and applications
• Merge-and-Shrink Abstraction
• The computational complexity of avoiding spurious states in state space abstraction
• Linear-time disk-based implicit graph search
• Automatically generating abstractions for planning
• A general theory of additive state space abstractions
• A theory of abstraction
• Downward refinement and the efficiency of hierarchical problem solving
• The complexity of optimal monotonic planning: the bad, the good, and the causal graph
• A complete parameterized complexity analysis of bounded planning
• ``Distance? Who cares? Tailoring merge-and-shrink heuristics to detect unsolvability
• Red-black planning: a new systematic approach to partial delete relaxation
• Title not available (Why is that?)
• Friends or foes? On planning as satisfiability and abstract CNF encodings
• Planning in a hierarchy of abstraction spaces
• Title not available (Why is that?)
• Inconsistent heuristics in theory and practice
• Towards a practical theory of reformulation for reasoning about physical systems
• Macro-operators: A weak method for learning
• A method for computing heuristics in problem solving
• A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
• Title not available (Why is that?)
• Path Problems in Structured Graphs
• The complexity of searching implicit graphs
• Calculating criticalities
• Title not available (Why is that?)
• Counterexample-guided Cartesian abstraction refinement for classical planning
• Explaining non-acceptability in abstract argumentation
• Abstract interpretation

Cited In (7)

• State trace analysis: what it can and cannot do
• Merge-and-shrink: a compositional theory of transformations of factored transition systems
• The computational complexity of avoiding spurious states in state space abstraction
• Algebraic Methodology and Software Technology
• Agent abstraction via forgetting in the situation calculus
• The Spotlight Principle
• Deriving State-Based Implementations of Interactive Components with History Abstractions

This page was built for publication: A framework for analysing state-abstraction methods

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