On the public citation graph
Taming Numbers and Durations in the Model Checking Integrated Planning System
0 signed · 43 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.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferredcites →https://doi.org/10.1007/10720246_9openalex-snapshot
Numeric State Variables in Constraint-Based Planning
inferredcites →https://doi.org/10.1007/3-540-39963-1_23openalex-snapshot
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
inferredcites →https://doi.org/10.1007/3-540-44957-4_50openalex-snapshot
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
inferredcites →https://doi.org/10.1007/3-540-45422-5_13openalex-snapshot
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
inferredcites →https://doi.org/10.1007/3-540-45622-8_7openalex-snapshot
Symbolic Heuristic Search Using Decision Diagrams
inferredcites →https://doi.org/10.1007/3-540-48119-2_13openalex-snapshot
Error Detection with Directed Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-63912-8_81openalex-snapshot
Planning via model checking: A decision procedure for AR
inferredcites →https://doi.org/10.1007/s10009-002-0104-3openalex-snapshot
Directed explicit-state model checking in the validation of communication protocols
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/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/s0004-3702(01)00106-0openalex-snapshot
LAO∗: A heuristic search algorithm that finds solutions with loops
inferredcites →https://doi.org/10.1016/s0004-3702(99)00071-5openalex-snapshot
Using temporal logics to express search control knowledge for planning
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/566171.566175openalex-snapshot
Model checking Java programs using structural heuristics
inferredcites →https://doi.org/10.1184/r1/6607754openalex-snapshot
Nonlinear Planning with Parallel Resource Allocation
inferredcites →https://doi.org/10.1613/jair.477openalex-snapshot
Computational Aspects of Reordering Plans
inferredcites →https://doi.org/10.1613/jair.649openalex-snapshot
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.21236/ada285888openalex-snapshot
Generating Parallel Execution Plans with a Partial Order Planner
inferredcites →https://doi.org/10.5555/777092.777164openalex-snapshot
Symbolic heuristic search for factored Markov decision processes
inferredcites →https://doi.org/10.5555/777092.777195openalex-snapshot
SetA*: an efficient BDD-based heuristic search algorithm
inferredcites →https://doi.org/10.7916/d8hq46x1openalex-snapshot
Depth-First Iterative Deepening: An Optimal Admissible Tree Search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841883_29openalex-snapshot
Heuristic Search for the Analysis of Graph Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30133-2_2openalex-snapshot
FHP: Functional Heuristic Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-30221-6_15openalex-snapshot
Applying Automatic Planning Systems to Airport Ground-Traffic Control – A Feasibility Study
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_12openalex-snapshot
Handling Numeric Criteria in Relaxed Planning Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_3openalex-snapshot
Automated Creation of Pattern Database Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-85845-4_33openalex-snapshot
Repairing Decision-Theoretic Policies Using Goal-Oriented Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-25116-0_6openalex-snapshot
Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning
inferred← citeshttps://doi.org/10.1007/s10009-009-0110-9openalex-snapshot
Solving scheduling problems by untimed model checking
inferred← citeshttps://doi.org/10.1007/s10462-010-9190-xopenalex-snapshot
Improving concurrency in temporal plans
inferred← citeshttps://doi.org/10.1007/s10489-011-0306-zopenalex-snapshot
A universal planning system for hybrid domains
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.010openalex-snapshot
Anytime heuristic search for partial satisfaction 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.jcss.2015.04.002openalex-snapshot
A complete parameterized complexity analysis of bounded planning
inferred← citeshttps://doi.org/10.1109/etfa.2009.5347007openalex-snapshot
An artificial intelligence planning tool for the container stacking problem
inferred← citeshttps://doi.org/10.1109/ictai.2009.53openalex-snapshot
A Planning Tool for Minimizing Reshuffles in Container Terminals
inferred← citeshttps://doi.org/10.1109/ictai.2016.0086openalex-snapshot
Temporal Planning with Extended Timed Automata
inferred← citeshttps://doi.org/10.1109/qrs54544.2021.00079openalex-snapshot
Improving Quality of Counterexamples in Model Checking via Automated Planning
inferred← citeshttps://doi.org/10.1142/s0218213016500287openalex-snapshot
Path-Cost Bounds for Parameterized Centralized Variants of A* for Static and Certain Environments
inferred← citeshttps://doi.org/10.70675/40c2985dz31eaz4c21zb123z805114da3a7fopenalex-snapshot
Temporal and Hierarchical Models for Planning and Acting in Robotics
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.