On the public citation graph
Property Directed Reachability for Automated Planning
0 signed · 53 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-63912-8_88openalex-snapshot
Combining the expressivity of UCPOP with the efficiency of Graphplan
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_7openalex-snapshot
SAT-Based Model Checking without Unrolling
inferredcites →https://doi.org/10.1007/s10703-012-0157-1openalex-snapshot
Symbolic backward reachability with effectively propositional logic
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50033-7openalex-snapshot
Some Philosophical Problems from the Standpoint of Artificial Intelligence
inferredcites →https://doi.org/10.1016/b978-0-934613-32-3.50026-5openalex-snapshot
The Case for Domain-Specific Frame Axioms
inferredcites →https://doi.org/10.1016/j.artint.2006.08.002openalex-snapshot
Planning as satisfiability: parallel plans and algorithms for plan search
inferredcites →https://doi.org/10.1016/j.artint.2008.10.013openalex-snapshot
Concise finite-domain representations for PDDL planning tasks
inferredcites →https://doi.org/10.1016/j.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferredcites →https://doi.org/10.1016/j.ipl.2010.12.003openalex-snapshot
Maximum subset intersection
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1108/ir.2005.04932eae.001openalex-snapshot
Automated Planning: Theory and Practice
inferredcites →https://doi.org/10.1109/fmcad.2007.4401997openalex-snapshot
Checking Safety by Inductive Generalization of Counterexamples to Induction
inferredcites →https://doi.org/10.1109/ictai.2004.120openalex-snapshot
VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1609/icaps.v20i1.13402openalex-snapshot
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
inferredcites →https://doi.org/10.1609/icaps.v24i1.13655openalex-snapshot
Property Directed Reachability for Automated Planning
inferredcites →https://doi.org/10.1609/socs.v4i1.18294openalex-snapshot
Fast Detection of Unsolvable Planning Instances Using Local Consistency
inferredcites →https://doi.org/10.1613/jair.4231openalex-snapshot
Property Directed Reachability for Automated Planning
inferredcites →https://doi.org/10.1613/jair.570openalex-snapshot
Efficient Implementation of the Plan Graph in STAN
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.23919/fmcad.2017.8102233openalex-snapshot
Hardware model checking competition 2017
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-568openalex-snapshot
Regression for Classical and Nondeterministic Planning
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-441openalex-snapshot
“Distance”? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability
inferredcites →https://doi.org/10.5451/unibas-ep23561openalex-snapshot
BJOLP: the Big Joint Optimal Landmarks Planner
inferredcites →https://doi.org/10.5555/2157654.2157675openalex-snapshot
Efficient implementation of property directed reachability
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-32409-4_2openalex-snapshot
Using DimSpec for Bounded and Unbounded Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_3openalex-snapshot
Exploiting Adjoints in Property Directed Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_27openalex-snapshot
Computing with SAT Oracles: Past, Present and Future
inferred← citeshttps://doi.org/10.1007/s10703-026-00496-7openalex-snapshot
Adjointness in property directed reachability analysis
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.1017/s1471068419000395openalex-snapshot
Domain-Independent Cost-Optimal Planning in ASP
inferred← citeshttps://doi.org/10.1109/tcad.2022.3198260openalex-snapshot
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR
inferred← citeshttps://doi.org/10.1145/3656435openalex-snapshot
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
inferred← citeshttps://doi.org/10.1145/3832160openalex-snapshot
Fuzzing FPGA Synthesis and Simulation Tools via LLM-Generated Syntax-Valid HDL Codes
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21225openalex-snapshot
Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13655openalex-snapshot
Property Directed Reachability for Automated Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13766openalex-snapshot
Numeric Planning with Disjunctive Global Constraints via SMT
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13798openalex-snapshot
Accelerating SAT Based Planning with Incremental SAT Solving
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13802openalex-snapshot
Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6649openalex-snapshot
Certified Unsolvability for SAT Planning with Property Directed Reachability
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21756openalex-snapshot
On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE*
inferred← citeshttps://doi.org/10.1613/jair.1.11875openalex-snapshot
Subgoaling Techniques for Satisficing and Optimal Numeric Planning
inferred← citeshttps://doi.org/10.22028/d291-26627openalex-snapshot
Resolution-based methods for linear temporal reasoning
inferred← citeshttps://doi.org/10.23919/date.2018.8341978openalex-snapshot
Combining PDR and reverse PDR for hardware model checking
inferred← citeshttps://doi.org/10.24963/ijcai.2017/614openalex-snapshot
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning
inferred← citeshttps://doi.org/10.24963/kr.2023/16openalex-snapshot
Property Directed Reachability for Planning Revisited
inferred← citeshttps://doi.org/10.3390/sym11020197openalex-snapshot
An Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers
inferred← citeshttps://doi.org/10.5451/unibas-ep45249openalex-snapshot
Correlation Complexity of Classical Planning Domains
showing the first 23 of 24 · page through all 24
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.