On the public citation graph
Soft Goals Can Be Compiled Away
0 signed · 32 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-48238-5_15openalex-snapshot
Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms
inferredcites →https://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferredcites →https://doi.org/10.1016/j.artint.2008.11.010openalex-snapshot
Anytime heuristic search for partial satisfaction planning
inferredcites →https://doi.org/10.1016/j.artint.2008.11.011openalex-snapshot
A heuristic search approach to planning with temporally extended preferences
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-031-08421-8_2openalex-snapshot
A Sound (But Incomplete) Polynomial Translation from Discretised PDDL+ to Numeric Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-06483-3_15openalex-snapshot
Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_3openalex-snapshot
Non-classical Planning with a Classical Planner: The Power of Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-15246-7_23openalex-snapshot
Partial Weighted MaxSAT for Optimal Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-25274-7_19openalex-snapshot
Using the Relaxed Plan Heuristic to Select Goals in Oversubscription Planning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_10openalex-snapshot
Preference-Based Planning via MaxSAT
inferred← citeshttps://doi.org/10.1007/978-981-95-3052-6_8openalex-snapshot
MFTP: Multi-round Feedback for Dynamic Travel Itinerary Optimization
inferred← citeshttps://doi.org/10.1007/s10458-018-9394-zopenalex-snapshot
Action dependencies in privacy-preserving multi-agent planning
inferred← citeshttps://doi.org/10.1016/j.artint.2015.01.004openalex-snapshot
The deterministic part of the seventh International Planning Competition
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103414openalex-snapshot
Selecting goals in oversubscription planning using relaxed plans
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.03.045openalex-snapshot
Automated context aware composition of Advanced Telecom Services for environmental early warnings
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.10.030openalex-snapshot
Planning for tourism routes using social networks
inferred← citeshttps://doi.org/10.1017/s0269888925100076openalex-snapshot
Optimally stable plan repair
inferred← citeshttps://doi.org/10.1109/cig.2014.6932890openalex-snapshot
Using partial satisfaction planning to automatically select NPCs' goals and generate plans in a simulation game
inferred← citeshttps://doi.org/10.1109/icccr69988.2026.11642716openalex-snapshot
Disentangling Feasibility and Cost in Multi-Goal Classical Planning Via Goal Configuration Topology
inferred← citeshttps://doi.org/10.1109/smc-it.2017.25openalex-snapshot
Sensor Planning System for the Space Situational Awareness (SSA) Project
inferred← citeshttps://doi.org/10.1111/exsy.12693openalex-snapshot
On‐line modelling and planning for urban traffic control
inferred← citeshttps://doi.org/10.1142/s2301385021500151openalex-snapshot
A Survey of Motion and Task Planning Techniques for Unmanned Multicopter Systems
inferred← citeshttps://doi.org/10.1145/3461702.3462607openalex-snapshot
Computing Plans that Signal Normative Compliance
inferred← citeshttps://doi.org/10.2200/s00513ed1v01y201306aim022openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferred← citeshttps://doi.org/10.2200/s00900ed2v01y201902aim042openalex-snapshot
An Introduction to the Planning Domain Definition Language
inferred← citeshttps://doi.org/10.3233/aic-150692openalex-snapshot
Compiling irrelevant objects to counters. Special case of creation planning
inferred← citeshttps://doi.org/10.3233/aic-180753openalex-snapshot
Anticipation of goals in automated planning
inferred← citeshttps://doi.org/10.70675/cdbc9d15zedccz471az9398zed83a64b5068openalex-snapshot
A preference-based approach to machine ethics for automated planning
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.