On the public citation graph

Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting

0 signed · 94 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.1002/9781119508557.ch12openalex-snapshot
Introduction to Bayesian Networks
inferredcites →https://doi.org/10.1016/0004-3702(94)00087-hopenalex-snapshot
An algorithm for probabilistic planning
inferredcites →https://doi.org/10.1016/0004-3702(94)00092-1openalex-snapshot
On the hardness of approximate reasoning
inferredcites →https://doi.org/10.1016/0004-3702(94)90002-7openalex-snapshot
Modeling a dynamic and uncertain world I
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/0888-613x(93)90027-bopenalex-snapshot
The role of relevance in explanation I: Irrelevance as statistical independence
inferredcites →https://doi.org/10.1016/0888-613x(94)00019-yopenalex-snapshot
The role of relevance in explanation II: Disjunctive assignments and approximate independence
inferredcites →https://doi.org/10.1016/j.artint.2006.01.003openalex-snapshot
Conformant planning via heuristic forward search: A new approach
inferredcites →https://doi.org/10.1016/s0004-3702(00)00069-2openalex-snapshot
Recursive conditioning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(02)00379-xopenalex-snapshot
Contingent planning under uncertainty via stochastic satisfiability
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1016/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1016/s0004-3702(99)00059-4openalex-snapshot
Bucket elimination: A unifying framework for reasoning
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1016/s0888-613x(00)00067-0openalex-snapshot
Constant-space reasoning in dynamic Bayesian networks
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00324.xopenalex-snapshot
A model for reasoning about persistence and causation
inferredcites →https://doi.org/10.1609/aimag.v21i2.1506openalex-snapshot
The 1998 AI Planning Systems Competition
inferredcites →https://doi.org/10.1613/jair.1701openalex-snapshot
Engineering a Conformant Probabilistic Planner
inferredcites →https://doi.org/10.1613/jair.505openalex-snapshot
The Computational Complexity of Probabilistic Planning
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.2307/2965591openalex-snapshot
An Introduction to Bayesian Networks.
inferredcites →https://doi.org/10.48550/arxiv.1302.3562openalex-snapshot
Context-Specific Independence in Bayesian Networks
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-30048-7_29openalex-snapshot
An Improved GPU-Based SAT Model Counter
inferred← citeshttps://doi.org/10.1007/978-3-030-39197-3_10openalex-snapshot
Exploiting Database Management Systems and Treewidth for Counting
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_13openalex-snapshot
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-08011-1_22openalex-snapshot
Practically Uniform Solution Sampling in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_22openalex-snapshot
Approximate Model Counting via Extension Rule
inferred← citeshttps://doi.org/10.1007/978-3-319-23540-0_6openalex-snapshot
On the Impact of Junction-Tree Topology on Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_11openalex-snapshot
Exploiting Treewidth for Projected Model Counting and Its Limits
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_21openalex-snapshot
A New Probabilistic Algorithm for Approximate Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-24873-3_2openalex-snapshot
A Translation Based Approach to Probabilistic Conformant Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_18openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.1007/978-981-97-5675-9_4openalex-snapshot
OCP: An Online Contingent Planning Method for Robot Tasks with Incomplete Knowledge
inferred← citeshttps://doi.org/10.1007/s10472-009-9170-5openalex-snapshot
Set-structured and cost-sharing heuristics for classical planning
inferred← citeshttps://doi.org/10.1007/s10601-015-9204-zopenalex-snapshot
On computing minimal independent support and its applications to sampling and counting
inferred← citeshttps://doi.org/10.1007/s11704-024-3631-1openalex-snapshot
PBCounter: weighted model counting on pseudo-boolean formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.003openalex-snapshot
Robust planning with incomplete domain models
inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.003openalex-snapshot
Advanced SMT techniques for weighted model integration
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103650openalex-snapshot
Exact stochastic constraint optimisation with applications in network analysis
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103753openalex-snapshot
Approximate weighted model integration on DNF structures
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103810openalex-snapshot
Solving Projected Model Counting by Utilizing Treewidth and its Limits
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104109openalex-snapshot
aspmc: New frontiers of algebraic answer set counting
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104114openalex-snapshot
Lifted algorithms for symmetric weighted first-order model sampling
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.03.006openalex-snapshot
Fast forward planning by guided enforced hill climbing
inferred← citeshttps://doi.org/10.1016/j.jcta.2026.106182openalex-snapshot
On the smallest antichain that generates an ideal of a given size
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.047openalex-snapshot
Two approximate algorithms for model counting
inferred← citeshttps://doi.org/10.1017/s147106842100003xopenalex-snapshot
Exploiting Database Management Systems and Treewidth for Counting
inferred← citeshttps://doi.org/10.1080/0952813x.2022.2122588openalex-snapshot
Combining bounded solving and controllable randomization for approximate model counting
inferred← citeshttps://doi.org/10.1098/rsos.230785openalex-snapshot
Logic + probabilistic programming + causal laws
inferred← citeshttps://doi.org/10.1103/physreve.109.055301openalex-snapshot
Ising model partition-function computation as a weighted counting problem
inferred← citeshttps://doi.org/10.1109/dft.2012.6378198openalex-snapshot
#SAT-based vulnerability analysis of security components — A case study
inferred← citeshttps://doi.org/10.1109/humanoids.2015.7363542openalex-snapshot
Continual planning for search and rescue robots
inferred← citeshttps://doi.org/10.1109/ictai.2019.00017openalex-snapshot
Centrality Heuristics for Exact Model Counting
inferred← citeshttps://doi.org/10.1109/lra.2021.3137549openalex-snapshot
Domain Concretization From Examples: Addressing Missing Domain Knowledge Via Robust Planning
inferred← citeshttps://doi.org/10.1109/tcad.2015.2448687openalex-snapshot
Formal Vulnerability Analysis of Security Components
inferred← citeshttps://doi.org/10.1111/coin.12098openalex-snapshot
Exact and Heuristic Algorithms for Risk‐Aware Stochastic Physical Search
inferred← citeshttps://doi.org/10.1145/3324884.3416563openalex-snapshot
TestMC
inferred← citeshttps://doi.org/10.1145/3368089.3417938openalex-snapshot
AlloyMC: Alloy meets model counting
inferred← citeshttps://doi.org/10.1145/3459080openalex-snapshot
The Model Counting Competition 2020
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8778openalex-snapshot
Compilation Based Approaches to Probabilistic Planning -- Thesis Summary
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8990openalex-snapshot
Distribution-Aware Sampling and Weighted Model Counting for SAT
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9038openalex-snapshot
A Relevance-Based Compilation Method for Conformant Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5505openalex-snapshot
ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5705openalex-snapshot
Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17474openalex-snapshot
Learning Branching Heuristics for Propositional Model Counting
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20518openalex-snapshot
ApproxASP – a Scalable Approximate Answer Set Counter
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13463openalex-snapshot
Planning and Acting in Incomplete Domains
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13540openalex-snapshot
Compiling Conformant Probabilistic Planning Problems into Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13718openalex-snapshot
A Compilation Based Approach to Conformant Probabilistic Planning with Stochastic Actions
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13840openalex-snapshot
Occupation Measure Heuristics for Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15963openalex-snapshot
Pattern Databases for Goal-Probability Maximization in Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19801openalex-snapshot
Pattern Selection Strategies for Pattern Databases in Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31532openalex-snapshot
A Counter-Example Based Approach to Probabilistic Conformant Planning
inferred← citeshttps://doi.org/10.1613/jair.3093openalex-snapshot
Planning with Noisy Probabilistic Relational Rules
inferred← citeshttps://doi.org/10.17169/refubium-12370openalex-snapshot
Planning and exploration in stochastic relational worlds
inferred← citeshttps://doi.org/10.22331/q-2021-03-15-410openalex-snapshot
Hyper-optimized tensor network contraction
inferred← citeshttps://doi.org/10.24963/ijcai.2019/163openalex-snapshot
GANAK: A Scalable Probabilistic Exact Model Counter
inferred← citeshttps://doi.org/10.24963/kr.2020/85openalex-snapshot
On the Approximability of Weighted Model Integration on DNF Structures
inferred← citeshttps://doi.org/10.24963/kr.2021/55openalex-snapshot
Gaussian Elimination Meets Maximum Satisfiability
inferred← citeshttps://doi.org/10.26076/3578-ed79openalex-snapshot
Planning, Acting, and Learning in Incomplete Domains
inferred← citeshttps://doi.org/10.4230/lipics.cp.2021.24openalex-snapshot
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization
inferred← citeshttps://doi.org/10.48550/arxiv.1104.5069openalex-snapshot
Synthesizing Robust Plans under Incomplete Domain Models
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5726openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7808openalex-snapshot
Automated Attack Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6682openalex-snapshot
Sampling Techniques for Boolean Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07601openalex-snapshot
Counting Answer Sets via Dynamic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1801.08365openalex-snapshot
Probabilistic Planning by Probabilistic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1805.05445openalex-snapshot
Exploiting Treewidth for Projected Model Counting and its Limits
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02239openalex-snapshot
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
inferred← citeshttps://doi.org/10.48550/arxiv.1908.04381openalex-snapshot
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09755openalex-snapshot
Phase Transition Behavior of Cardinality and XOR Constraints
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.