On the public citation graph
OBDDs in heuristic search
0 signed · 77 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/3-540-60343-3_29openalex-snapshot
Efficient memory-limited graph search
inferredcites →https://doi.org/10.1007/3-540-61291-2_68openalex-snapshot
Searching with pattern databases
inferredcites →https://doi.org/10.1007/3-540-63166-6_50openalex-snapshot
μcke — Efficient μ-calculus model checking
inferredcites →https://doi.org/10.1007/3-540-64575-6_36openalex-snapshot
Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.5555/317825.317964openalex-snapshot
Symbolic Manipulation of Boolean Functions Using a Graphical Representation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/qre.70052openalex-snapshot
An Innovative Heuristic to Detect Special States in Concurrent Software Systems
inferred← citeshttps://doi.org/10.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferred← citeshttps://doi.org/10.1007/11527862_22openalex-snapshot
Experiments with Multiple Abstraction Heuristics in Symbolic Verification
inferred← citeshttps://doi.org/10.1007/11941439_67openalex-snapshot
BDDRPA*: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning
inferred← citeshttps://doi.org/10.1007/3-540-45139-0_5openalex-snapshot
Directed explicit model checking with HSF-SPIN
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_17openalex-snapshot
Finding Optimal Solutions to Atomix
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_7openalex-snapshot
Symbolic Heuristic Search Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_13openalex-snapshot
Error Detection with Directed Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-18026-3_3openalex-snapshot
BDD Optimization and Approximation: A Multi-criteria Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-22879-7_3openalex-snapshot
BDD-Optimierung und Approximation: Ein multikriterieller Ansatz
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_4openalex-snapshot
Using SPIN for the Optimized Scheduling of Discrete Event Systems in Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-319-53354-4_2openalex-snapshot
Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System
inferred← citeshttps://doi.org/10.1007/978-3-540-24581-0_83openalex-snapshot
Heuristic Search Algorithms Based on Symbolic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_17openalex-snapshot
Abstraction-Based Model Checking Using Heuristical Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_43openalex-snapshot
Solving Box-Pushing Games via Model Checking with Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_21openalex-snapshot
I/O Efficient Directed Model Checking
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_24openalex-snapshot
Partial Symbolic Pattern Databases for Optimal Sequential Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_28openalex-snapshot
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
inferred← citeshttps://doi.org/10.1007/978-3-642-58322-3_8openalex-snapshot
Neue Wege in der Exploration
inferred← citeshttps://doi.org/10.1007/s00236-012-0161-3openalex-snapshot
Abstract reduction in directed model checking CCS processes
inferred← citeshttps://doi.org/10.1007/s00500-018-3444-yopenalex-snapshot
MS-ACO: a multi-stage ant colony optimization to refute complex software systems specified through graph transformation
inferred← citeshttps://doi.org/10.1007/s00500-019-04334-3openalex-snapshot
An approach based on knowledge exploration for state space management in checking reachability of complex software systems
inferred← citeshttps://doi.org/10.1007/s10009-002-0104-3openalex-snapshot
Directed explicit-state model checking in the validation of communication protocols
inferred← citeshttps://doi.org/10.1007/s10009-003-0130-9openalex-snapshot
Heuristics for model checking Java programs
inferred← citeshttps://doi.org/10.1007/s10270-014-0416-2openalex-snapshot
Heuristic search for equivalence checking
inferred← citeshttps://doi.org/10.1007/s10703-008-0052-yopenalex-snapshot
The symbolic OBDD scheme for generating mechanical assembly sequences
inferred← citeshttps://doi.org/10.1016/j.artint.2007.05.009openalex-snapshot
State-set branching: Leveraging BDDs for heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2009.06.004openalex-snapshot
Weighted A ∗ search – unifying view and application
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.2018.02.002openalex-snapshot
Symbolic perimeter abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.06.055openalex-snapshot
A heuristic solution for model checking graph transformation systems
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.004openalex-snapshot
Using heuristic search for finding deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.infsof.2018.01.004openalex-snapshot
Searching for violation of safety and liveness properties using knowledge discovery in complex systems specified through graph transformations
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.003openalex-snapshot
DELFIN+: An efficient deadlock detection tool for CCS processes
inferred← citeshttps://doi.org/10.1016/j.jss.2017.05.128openalex-snapshot
Deadlock detection in complex software systems specified through graph transformation using Bayesian optimization algorithm
inferred← citeshttps://doi.org/10.1109/snpd.2009.9openalex-snapshot
A Generalized Framework for BDD-based Replanning A* Search
inferred← citeshttps://doi.org/10.1109/tse.2003.1205179openalex-snapshot
Heuristic search + local model checking in selective mu-calculus
inferred← citeshttps://doi.org/10.1145/2739480.2754718openalex-snapshot
Multi-Objective BDD Optimization with Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1145/3649921.3650014openalex-snapshot
Comprehensive and Instantly Responsive Player Assistance using Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1145/3723498.3723795openalex-snapshot
Analytic Procgen with Composable Design Space Expressions
inferred← citeshttps://doi.org/10.11606/d.45.2018.tde-20230727-113624openalex-snapshot
Planejamento baseado em verificação simbólica de modelos
inferred← citeshttps://doi.org/10.1184/r1/6603239openalex-snapshot
An Efficient BDD-Based A* Algorithm
inferred← citeshttps://doi.org/10.1184/r1/6622415openalex-snapshot
Guided Symbolic Universal Planning
inferred← citeshttps://doi.org/10.1587/transinf.2017edp7109openalex-snapshot
BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8009openalex-snapshot
Improving Cost-Optimal Domain-Independent Symbolic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9349openalex-snapshot
BDDs Strike Back (in AI Planning)
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21210openalex-snapshot
Operator-Potential Heuristics for Symbolic Search
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13558openalex-snapshot
Transition Trees for Cost-Optimal Symbolic 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.v28i1.13890openalex-snapshot
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams
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.v32i1.19788openalex-snapshot
Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18285openalex-snapshot
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
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.20944/preprints202010.0288.v1openalex-snapshot
Fuzzy particle swarm optimization algorithm (NFPSO) for reachability analysis of complex software systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-738517/v1openalex-snapshot
Checking Reachability Property in Complex Concurrent Software Systems with a Knowledge Discovery Approach
inferred← citeshttps://doi.org/10.23919/ccc64809.2025.11178672openalex-snapshot
Regression-Based Task Dependency Decomposition for Mobile Manipulation with Symbolic Planning
inferred← citeshttps://doi.org/10.3233/ifs-162127openalex-snapshot
A greedy algorithm versus metaheuristic solutions to deadlock detection in Graph Transformation Systems
inferred← citeshttps://doi.org/10.3233/jifs-190023openalex-snapshot
An efficient approach to state space management in model checking of complex software systems using machine learning techniques
inferred← citeshttps://doi.org/10.3390/mca30030065openalex-snapshot
A Hybrid Approach for Reachability Analysis of Complex Software Systems Using Fuzzy Adaptive Particle Swarm Optimization Algorithm and Rule Composition
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.373-375.1144openalex-snapshot
Research on Vehicle Path Planning Based on the BDD in the Uncertain Environment
inferred← citeshttps://doi.org/10.4204/eptcs.99.8openalex-snapshot
Lex-Partitioning: A New Option for BDD Search
inferred← citeshttps://doi.org/10.5220/0005705100270037openalex-snapshot
Branch-and-Bound Optimization of a Multiagent System for Flow Production using Model Checking
inferred← citeshttps://doi.org/10.52547/jsdp.19.1.153openalex-snapshot
Reachability checking in complex and concurrent software systems using intelligent search methods
inferred← citeshttps://doi.org/10.5555/777092.777164openalex-snapshot
Symbolic heuristic search for factored Markov decision processes
inferred← citeshttps://doi.org/10.5555/777092.777195openalex-snapshot
SetA*: an efficient BDD-based heuristic search algorithm
inferred← citeshttps://doi.org/10.61186/jsdp.20.2.175openalex-snapshot
Checking reachability property of systems specified through graph transformation with the approach of discovery conditional dependency between the rules
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.