On the public citation graph

Merge-and-Shrink Abstraction

0 signed · 114 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1996.0016openalex-snapshot
Complexity of Generalized Satisfiability Counting Problems
inferredcites →https://doi.org/10.1007/11691617_2openalex-snapshot
Directed Model Checking with Distance-Preserving Abstractions
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-44829-2_13openalex-snapshot
Promela Planning
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/978-94-017-0257-7openalex-snapshot
Diagnosis of Active Systems
inferredcites →https://doi.org/10.1007/s10009-008-0092-zopenalex-snapshot
Directed model checking with distance-preserving abstractions
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/0933-3657(92)90044-popenalex-snapshot
Handbook of theoretical computer science
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50040-6openalex-snapshot
GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT
inferredcites →https://doi.org/10.1016/j.artint.2006.09.002openalex-snapshot
Maximizing over multiple pattern databases speeds up heuristic search
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/26.35374openalex-snapshot
An algorithmic procedure for checking safety properties of protocols
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1111/0824-7935.00065openalex-snapshot
Pattern Databases
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1111/j.1467-8640.2010.00370.xopenalex-snapshot
EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION
inferredcites →https://doi.org/10.1130/0016-7606(1945)56[275:edosat]2.0.co;2openalex-snapshot
EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGY
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13345openalex-snapshot
Preferred Operators and Deferred Evaluation in Satisficing Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v20i1.13429openalex-snapshot
Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF
inferredcites →https://doi.org/10.1609/icaps.v20i1.13431openalex-snapshot
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
inferredcites →https://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.1613/jair.1705openalex-snapshot
The Fast Downward Planning System
inferredcites →https://doi.org/10.48550/arxiv.1306.4044openalex-snapshot
Attack Planning in the Real World
inferredcites →https://doi.org/10.5451/unibas-ep23561openalex-snapshot
BJOLP: the Big Joint Optimal Landmarks Planner
inferredcites →https://doi.org/10.5451/unibas-ep29132openalex-snapshot
How to relax a bisimulation?
inferredcites →https://doi.org/10.5555/1622559.1622565openalex-snapshot
The fast downward planning system
inferredcites →https://doi.org/10.5555/1622810.1622817openalex-snapshot
A knowledge compilation map
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-331openalex-snapshot
Computing perfect heuristics in polynomial time : on bisimulation and merge-and-shrink abstractions in optimal planning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/aaai.70034openalex-snapshot
Model‐based AI planning and execution platforms for robotics
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_38openalex-snapshot
Abstraction for Non-ground Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-24489-1_13openalex-snapshot
An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-57351-9_44openalex-snapshot
Diverse Action Costs in Heuristic Search and Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_6openalex-snapshot
Star-Topology Decoupling in SPIN
inferred← citeshttps://doi.org/10.1007/978-3-662-33783-7_7openalex-snapshot
Über den Einfluss der Schneide auf die Schwingungsdauer des Pendels und der Waage
inferred← citeshttps://doi.org/10.1007/s10458-016-9333-9openalex-snapshot
Collaborative privacy preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10472-024-09947-5openalex-snapshot
Domain independent heuristics for online stochastic contingent planning
inferred← citeshttps://doi.org/10.1007/s13218-015-0409-5openalex-snapshot
Search Challenges in Natural Language Generation with Complex Optimization Objectives
inferred← citeshttps://doi.org/10.1016/j.artint.2016.10.001openalex-snapshot
Efficient symbolic search for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.004openalex-snapshot
Star-topology decoupled state space search
inferred← citeshttps://doi.org/10.1016/j.artint.2018.02.002openalex-snapshot
Symbolic perimeter abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103414openalex-snapshot
Selecting goals in oversubscription planning using relaxed plans
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103608openalex-snapshot
A framework for analysing state-abstraction methods
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104174openalex-snapshot
Boosting optimal symbolic planning: Operator-potential heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104468openalex-snapshot
Is DIBBS a DXBB algorithm?
inferred← citeshttps://doi.org/10.1017/s0269888916000230openalex-snapshot
Parallel heuristic search in forward partial-order planning
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1409278openalex-snapshot
PDDL4J: a planning domain description library for java
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197045openalex-snapshot
MAMS-A: Multi-Agent Multi-Scale A*
inferred← citeshttps://doi.org/10.1109/ictai.2016.0027openalex-snapshot
HTN Planning Approach Using Fully Instantiated Problems
inferred← citeshttps://doi.org/10.1109/ictai.2017.00093openalex-snapshot
Heuristic Approach to Guarantee Safe Solutions in Probabilistic Planning
inferred← citeshttps://doi.org/10.1142/s2301385021500151openalex-snapshot
A Survey of Motion and Task Planning Techniques for Unmanned Multicopter Systems
inferred← citeshttps://doi.org/10.1145/3533767.3534392openalex-snapshot
Metamorphic relations via relaxations: an approach to obtain oracles for action-policy testing
inferred← citeshttps://doi.org/10.1177/09217126251323880openalex-snapshot
Analysis of Planning Instances Without Search
inferred← citeshttps://doi.org/10.1177/30504554251323880openalex-snapshot
Analysis of Planning Instances Without Search
inferred← citeshttps://doi.org/10.1515/9783111386690-004openalex-snapshot
513 Planen
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9028openalex-snapshot
Generalized Label Reduction for Merge-and-Shrink Heuristics
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9642openalex-snapshot
Factored Symmetries for Merge-and-Shrink Abstractions
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9649openalex-snapshot
Heuristics and Symmetries in Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10071openalex-snapshot
Tiebreaking Strategies for A* Search: How to Explore the Final Frontier
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11022openalex-snapshot
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17419openalex-snapshot
Saturated Post-hoc Optimization for Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17422openalex-snapshot
Symbolic Search for Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13637openalex-snapshot
Symbolic and Explicit Search Hybrid through Perfect Hash Functions — A Case Study in Connect Four
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13727openalex-snapshot
Sequencing Operator Counts
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13732openalex-snapshot
On the Expressive Power of Non-Linear Merge-and-Shrink Representations
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13733openalex-snapshot
A Normal Form for Classical Planning Tasks
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13763openalex-snapshot
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13806openalex-snapshot
Abstraction Heuristics, Cost Partitioning and Network Flows
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13823openalex-snapshot
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13885openalex-snapshot
MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13890openalex-snapshot
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13899openalex-snapshot
A Proof System for Unsolvable Planning Tasks
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13904openalex-snapshot
Symmetry-Based Task Reduction for Relaxed Reachability Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13932openalex-snapshot
The Factored Shortest Path Problem and Its Applications in Robotics
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3482openalex-snapshot
Oversubscription Planning as Classical Planning with Multiple Cost Functions
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3509openalex-snapshot
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks
inferred← citeshttps://doi.org/10.1609/socs.v16i1.27309openalex-snapshot
Domain-Independent Dynamic Programming (Student Abstract)
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18330openalex-snapshot
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18353openalex-snapshot
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18356openalex-snapshot
The Spurious Path Problem in Abstraction
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18373openalex-snapshot
A Preliminary Selection of Problems in Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18429openalex-snapshot
Strengthening Canonical Pattern Databases with Structural Symmetries
inferred← citeshttps://doi.org/10.1613/jair.1.11213openalex-snapshot
Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11422openalex-snapshot
Computing Multi-Modal Journey Plans under Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.1.12557openalex-snapshot
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems
inferred← citeshttps://doi.org/10.1613/jair.1.13768openalex-snapshot
Classical Planning in Deep Latent Space
inferred← citeshttps://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferred← citeshttps://doi.org/10.1613/jair.4586openalex-snapshot
BDD Ordering Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.5249openalex-snapshot
Tie-Breaking Strategies for Cost-Optimal Best First Search
inferred← citeshttps://doi.org/10.24963/ijcai.2017/599openalex-snapshot
Additive Merge-and-Shrink Heuristics for Diverse Action Costs
inferred← citeshttps://doi.org/10.24963/ijcai.2020/574openalex-snapshot
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2021/554openalex-snapshot
Efficient Black-Box Planning Using Macro-Actions with Focused Effects
inferred← citeshttps://doi.org/10.24963/kr.2021/3openalex-snapshot
Generalized Temporal Inference via Planning
inferred← citeshttps://doi.org/10.3233/aic-150666openalex-snapshot
Vectorial Pattern Databases
inferred← citeshttps://doi.org/10.3233/aic-150692openalex-snapshot
Compiling irrelevant objects to counters. Special case of creation planning
inferred← citeshttps://doi.org/10.3233/aic-230058openalex-snapshot
Revisiting block deordering in finite-domain state variable planning
inferred← citeshttps://doi.org/10.3233/faia200364openalex-snapshot
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space
inferred← citeshttps://doi.org/10.4204/eptcs.391.11openalex-snapshot
Rollout Heuristics for Online Stochastic Contingent Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1810.10910openalex-snapshot
Une approche totalement instanciée pour la planification HTN
inferred← citeshttps://doi.org/10.48550/arxiv.1811.00210openalex-snapshot
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04998openalex-snapshot
Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems
inferred← citeshttps://doi.org/10.5451/unibas-ep43157openalex-snapshot
Heuristics for cost-optimal classical planning based on linear programming
inferred← citeshttps://doi.org/10.5451/unibas-ep59294openalex-snapshot
ERGO: A Framework for the Development of Autonomous Robots
inferred← citeshttps://doi.org/10.5451/unibas-ep81224openalex-snapshot
Reinforcement Learning for Planning Heuristics
inferred← citeshttps://doi.org/10.5451/unibas-ep81249openalex-snapshot
Explainable Planner Selection
inferred← citeshttps://doi.org/10.5451/unibas-ep84326openalex-snapshot
Neural Network Heuristic Functions for Classical Planning: Reinforcement Learning and Comparison to Other Methods
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.