On the public citation graph
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
0 signed · 78 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230100403openalex-snapshot
A dual algorithm for the constrained shortest path problem
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-031-01564-9openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_46openalex-snapshot
An LP-Based Heuristic for Optimal Planning
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
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(96)00007-0openalex-snapshot
Artificial intelligence: A modern approach
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/0377-2217(87)90165-2openalex-snapshot
Exact methods for the knapsack problem and its generalizations
inferredcites →https://doi.org/10.1016/j.artint.2008.01.002openalex-snapshot
An approach to efficient planning with numerical fluents and multi-criteria plan quality
inferredcites →https://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferredcites →https://doi.org/10.1016/j.artint.2008.10.012openalex-snapshot
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
inferredcites →https://doi.org/10.1016/j.artint.2008.11.010openalex-snapshot
Anytime heuristic search for partial satisfaction planning
inferredcites →https://doi.org/10.1016/j.artint.2008.11.011openalex-snapshot
A heuristic search approach to planning with temporally extended preferences
inferredcites →https://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferredcites →https://doi.org/10.1016/j.artint.2012.05.003openalex-snapshot
Landmark-enhanced abstraction heuristics
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1080/03155986.1988.11732063openalex-snapshot
A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/ictai.2010.86openalex-snapshot
Integrating Time and Resources into Planning
inferredcites →https://doi.org/10.1111/j.1467-8640.1991.tb00393.xopenalex-snapshot
Planning in polynomial time: the SAS‐PUBS class
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1145/1008731.1008733openalex-snapshot
Solving convex programs by random walks
inferredcites →https://doi.org/10.1145/509923.509926openalex-snapshot
Solving convex programs by random walks
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal 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.v21i1.13445openalex-snapshot
LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
inferredcites →https://doi.org/10.1609/icaps.v22i1.13509openalex-snapshot
Temporal Planning with Preferences and Time-Dependent Continuous Costs
inferredcites →https://doi.org/10.1609/icaps.v22i1.13514openalex-snapshot
Faster Bounded-Cost Search Using Inadmissible Estimates
inferredcites →https://doi.org/10.1609/icaps.v22i1.13515openalex-snapshot
Resource-Constrained Planning: A Monte Carlo Random Walk Approach
inferredcites →https://doi.org/10.1609/icaps.v23i1.13545openalex-snapshot
Abstractions for Oversubscription Planning
inferredcites →https://doi.org/10.1609/icaps.v23i1.13597openalex-snapshot
Heuristics for Bounded-Cost Search
inferredcites →https://doi.org/10.1613/jair.1129openalex-snapshot
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
inferredcites →https://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferredcites →https://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferredcites →https://doi.org/10.1613/jair.2817openalex-snapshot
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
inferredcites →https://doi.org/10.1613/jair.3788openalex-snapshot
Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.2200/s00513ed1v01y201306aim022openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-329openalex-snapshot
Strengthening Landmark Heuristics via Hitting Sets
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-633openalex-snapshot
Landmarks in Oversubscription Planning
inferredcites →https://doi.org/10.48550/arxiv.1107.0025openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119openalex-snapshot
Bounded suboptimal search: a direct approach using inadmissible estimates
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-31423-1_9openalex-snapshot
Explainable AI Planning (XAIP): Overview and the Case of Contrastive Explanation (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-032-39395-1_37openalex-snapshot
Exploring Plan Space Through Conversation: An Agentic Framework for LLM-Mediated Explanations in Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-45348-4_11openalex-snapshot
In Log and Model We Trust? A Generalized Conformance Checking Framework
inferred← citeshttps://doi.org/10.1007/s10472-021-09775-xopenalex-snapshot
Heuristic search for one-to-many shortest path queries
inferred← citeshttps://doi.org/10.1007/s13218-015-0403-yopenalex-snapshot
Interview with David E. Smith
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.2020.103414openalex-snapshot
Selecting goals in oversubscription planning using relaxed plans
inferred← citeshttps://doi.org/10.13140/rg.2.2.29112.39685openalex-snapshot
Automated Tactical Decision Planning Model with Strategic Values Guidance for Local Action-Value-Ambiguity
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10062openalex-snapshot
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33019999openalex-snapshot
Frontier Search and Plan Reconstruction in Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6534openalex-snapshot
A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17422openalex-snapshot
Symbolic Search for Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/aiide.v12i1.12860openalex-snapshot
PlotShot: Generating Discourse-Constrained Stories Around Photos
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13740openalex-snapshot
Revisiting Goal Probability Analysis in Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13886openalex-snapshot
Value Driven Landmarks for Oversubscription Planning
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.v32i1.19820openalex-snapshot
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19858openalex-snapshot
Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27177openalex-snapshot
On Partial Satisfaction Planning with Total-Order HTNs
inferred← citeshttps://doi.org/10.1613/jair.1.11635openalex-snapshot
Autonomous Target Search with Multiple Coordinated UAVs
inferred← citeshttps://doi.org/10.1613/jair.5153openalex-snapshot
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art
inferred← citeshttps://doi.org/10.24963/ijcai.2021/572openalex-snapshot
Learning Temporal Plan Preferences from Examples: An Empirical Study
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06606openalex-snapshot
Economics of Human-AI Ecosystem: Value Bias and Lost Utility in Multi-Dimensional Gaps
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09705openalex-snapshot
Iterative Planning with Plan-Space Explanations: A Tool and User Study
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.