On the public citation graph

BDD Ordering Heuristics for Classical Planning

0 signed · 50 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.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_5openalex-snapshot
Dynamic Variable Ordering for Ordered Binary Decision Diagrams
inferredcites →https://doi.org/10.1007/978-3-642-59615-5_6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
inferredcites →https://doi.org/10.1016/j.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.013openalex-snapshot
Causal graphs and structurally restricted planning
inferredcites →https://doi.org/10.1016/s0004-3702(02)00374-0openalex-snapshot
Weak, strong, and strong cyclic planning via symbolic model checking
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/iccad.1988.122450openalex-snapshot
Evaluation and improvement of Boolean comparison method based on binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iscas.1993.394067openalex-snapshot
Efficient variable ordering heuristics for shared ROBDD
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1137/1.9780898719789openalex-snapshot
Branching Programs and Binary Decision Diagrams
inferredcites →https://doi.org/10.1145/123186.123225openalex-snapshot
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
inferredcites →https://doi.org/10.1145/127601.127705openalex-snapshot
Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
inferredcites →https://doi.org/10.1145/2559951openalex-snapshot
Merge-and-Shrink Abstraction
inferredcites →https://doi.org/10.1145/322290.322292openalex-snapshot
A Sufficient Condition for Backtrack-Free Search
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1184/r1/6610106openalex-snapshot
Symbolic Model Checking with Partitioned Transition Relations
inferredcites →https://doi.org/10.1609/aaai.v25i1.8009openalex-snapshot
Improving Cost-Optimal Domain-Independent Symbolic Planning
inferredcites →https://doi.org/10.1609/aaai.v28i1.9028openalex-snapshot
Generalized Label Reduction for Merge-and-Shrink Heuristics
inferredcites →https://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI Planning
inferredcites →https://doi.org/10.1609/icaps.v21i1.13469openalex-snapshot
Where Ignoring Delete Lists Works, Part II: Causal Graphs
inferredcites →https://doi.org/10.1609/icaps.v23i1.13598openalex-snapshot
What’s in It for My BDD? On Causal Graphs and Variable Orders in Planning
inferredcites →https://doi.org/10.1609/socs.v5i1.18330openalex-snapshot
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions
inferredcites →https://doi.org/10.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.2432openalex-snapshot
The Complexity of Planning Problems With Simple Causal Graphs
inferredcites →https://doi.org/10.1613/jair.2498openalex-snapshot
New Islands of Tractability of Cost-Optimal Planning
inferredcites →https://doi.org/10.1613/jair.3063openalex-snapshot
Implicit Abstraction Heuristics
inferredcites →https://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferredcites →https://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
inferredcites →https://doi.org/10.22028/d291-26439openalex-snapshot
What’s in it for my BDD? On causal graphs and variable orders in planning
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119619727.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-031-87775-9_30openalex-snapshot
Local Model Checking on an IoT Based System: Use Case of Cellular M2M in Agriculture
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_19openalex-snapshot
Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/s00236-019-00351-9openalex-snapshot
Performance heuristics for GR(1) synthesis and related algorithms
inferred← citeshttps://doi.org/10.1016/j.apm.2025.116039openalex-snapshot
A review of decision diagrams in system reliability modeling and analysis
inferred← citeshttps://doi.org/10.1016/j.artint.2016.10.001openalex-snapshot
Efficient symbolic search for cost-optimal planning
inferred← citeshttps://doi.org/10.1109/access.2021.3081742openalex-snapshot
Handling State Space Explosion in Component-Based Software Verification: A Review
inferred← citeshttps://doi.org/10.1109/icsict49897.2020.9278214openalex-snapshot
New Bidirectional Fast BDD Dynamic Reordering Algorithm
inferred← citeshttps://doi.org/10.1109/rtest.2018.8397163openalex-snapshot
Probabilistic analysis of self-stabilizing systems: A case study on a mutual exclusion algorithm
inferred← citeshttps://doi.org/10.1109/tc.2015.2512872openalex-snapshot
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17396openalex-snapshot
Symbolic Search for Optimal Total-Order HTN Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17425openalex-snapshot
Faster Stackelberg Planning via Symbolic Search and Information Sharing
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6670openalex-snapshot
When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27220openalex-snapshot
Finding Matrix Multiplication Algorithms with Classical Planning
inferred← citeshttps://doi.org/10.4114/intartif.vol21iss62pp67-74openalex-snapshot
Characterizing and Computing All Delete-Relaxed Dead-ends
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.