On the public citation graph
Optimal Partial-Order Plan Relaxation via MaxSAT
0 signed · 59 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/978-3-642-15246-7_23openalex-snapshot
Partial Weighted MaxSAT for Optimal Planning
inferredcites →https://doi.org/10.1007/978-3-642-35101-3_68openalex-snapshot
Block-Structured Plan Deordering
inferredcites →https://doi.org/10.1007/978-3-642-40627-0_21openalex-snapshot
Postponing Optimization to Speed Up MAXSAT Solving
inferredcites →https://doi.org/10.1016/0004-3702(72)90051-3openalex-snapshot
Learning and executing generalized robot plans
inferredcites →https://doi.org/10.1016/0004-3702(94)00082-copenalex-snapshot
Plan reuse versus plan generation: a theoretical and empirical analysis
inferredcites →https://doi.org/10.1016/0004-3702(94)90005-1openalex-snapshot
On the computational complexity of temporal projection, planning, and plan validation
inferredcites →https://doi.org/10.1016/0004-3702(94)90011-6openalex-snapshot
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
inferredcites →https://doi.org/10.1016/j.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferredcites →https://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferredcites →https://doi.org/10.1023/a:1024120703127openalex-snapshot
DECAF - A Flexible Multi Agent System Architecture
inferredcites →https://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferredcites →https://doi.org/10.1145/103418.103441openalex-snapshot
Counting linear extensions is #P-complete
inferredcites →https://doi.org/10.1609/aaai.v27i1.8687openalex-snapshot
Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge
inferredcites →https://doi.org/10.1609/aimag.v15i4.1109openalex-snapshot
An Introduction to Least Commitment Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13343openalex-snapshot
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
inferredcites →https://doi.org/10.1609/icaps.v20i1.13403openalex-snapshot
Forward-Chaining Partial-Order Planning
inferredcites →https://doi.org/10.1609/icaps.v22i1.13537openalex-snapshot
Optimally Relaxing Partial-Order Plans with MaxSAT
inferredcites →https://doi.org/10.1609/icaps.v24i1.13628openalex-snapshot
Fragment-Based Planning Using Column Generation
inferredcites →https://doi.org/10.1609/icaps.v26i1.13772openalex-snapshot
Have I Been Here Before? State Memoization in Temporal Planning
inferredcites →https://doi.org/10.1613/jair.1136openalex-snapshot
VHPOP: Versatile Heuristic Partial Order Planner
inferredcites →https://doi.org/10.1613/jair.477openalex-snapshot
Computational Aspects of Reordering Plans
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.3233/978-1-61499-672-9-1044openalex-snapshot
Mathematical Programming Models for Optimizing Partial-Order Plan Flexibility
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.1002/aaai.12073openalex-snapshot
Hierarchical planning and reasoning about partially ordered plans—From theory to practice
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_15openalex-snapshot
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-81375-7_25openalex-snapshot
Discovering Order-Inducing Features in Event Knowledge Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00633-1openalex-snapshot
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
inferred← citeshttps://doi.org/10.1007/s10458-025-09706-8openalex-snapshot
Improving execution concurrency in partial-order plans via block-substitution
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.079openalex-snapshot
Minimals Plus: An improved algorithm for the random generation of linear extensions of partially ordered sets
inferred← citeshttps://doi.org/10.1016/j.robot.2026.105772openalex-snapshot
Parallelizing Task and Motion Planning in heterogeneous dual-robot systems using satisfiability solver
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115540openalex-snapshot
Max-SAT with cardinality constraint parameterized by the number of clauses
inferred← citeshttps://doi.org/10.1109/ascc70886.2026.11701811openalex-snapshot
A Partial-Order Execution Interface for Online 3D Bin Packing and Downstream TAMP
inferred← citeshttps://doi.org/10.1145/3629188.3629200openalex-snapshot
Improving MaxSAT-Reordered Plans via Block Deordering
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11528openalex-snapshot
Counting Linear Extensions in Practice: MCMC Versus Exponential Monte Carlo
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6530openalex-snapshot
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13901openalex-snapshot
Plan Relaxation via Action Debinding and Deordering
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3493openalex-snapshot
Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15944openalex-snapshot
A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in Partial Order Causal Link (POCL) Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11243openalex-snapshot
Watching and Acting Together: Concurrent Plan Recognition and Adaptation for Human-Robot Teams
inferred← citeshttps://doi.org/10.1613/jair.1.11375openalex-snapshot
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.1.13811openalex-snapshot
Proofs and Certificates for Max-SAT
inferred← citeshttps://doi.org/10.1613/jair.1.16374openalex-snapshot
Approximate Counting of Linear Extensions in Practice
inferred← citeshttps://doi.org/10.2139/ssrn.4865146openalex-snapshot
Max-Sat with Cardinality Constraint Parameterized by the Number of Clauses
inferred← citeshttps://doi.org/10.2200/s00900ed2v01y201902aim042openalex-snapshot
An Introduction to the Planning Domain Definition Language
inferred← citeshttps://doi.org/10.24963/ijcai.2017/74openalex-snapshot
The Mixing of Markov Chains on Linear Extensions in Practice
inferred← citeshttps://doi.org/10.24963/ijcai.2018/710openalex-snapshot
A Scalable Scheme for Counting Linear Extensions
inferred← citeshttps://doi.org/10.24963/ijcai.2020/573openalex-snapshot
Optimising Partial-Order Plans Via Action Reinstantiation
inferred← citeshttps://doi.org/10.24963/ijcai.2023/787openalex-snapshot
Proofs and Certificates for Max-SAT (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/kr.2023/80openalex-snapshot
Eliminating Redundant Actions from Plans Using Classical Planning
inferred← citeshttps://doi.org/10.3233/aic-230058openalex-snapshot
Revisiting block deordering in finite-domain state variable planning
inferred← citeshttps://doi.org/10.32614/rj-2021-077openalex-snapshot
volesti: Volume Approximation and Sampling for Convex Polytopes in R
inferred← citeshttps://doi.org/10.3390/e24111615openalex-snapshot
Quantum Algorithm for Variant Maximum Satisfiability
inferred← citeshttps://doi.org/10.4114/intartif.vol21iss62pp67-74openalex-snapshot
Characterizing and Computing All Delete-Relaxed Dead-ends
inferred← citeshttps://doi.org/10.48550/arxiv.2103.02355openalex-snapshot
Cost Optimal Planning as Satisfiability
inferred← citeshttps://doi.org/10.70675/0828a699zb67fz4a39z9886z8778df5dcea9openalex-snapshot
Mission planning for integrated marine robotic systems
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.