On the public citation graph
Abstract Reasoning for Planning and Coordination
0 signed · 56 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.1002/https://dx.doi.org/10.6028/nist.ir.5910openalex-snapshot
Unified Process Specification Language: Requirements for Modeling Process
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(91)90024-eopenalex-snapshot
O-Plan: The open planning architecture
inferredcites →https://doi.org/10.1016/0004-3702(95)00103-4openalex-snapshot
Collaborative plans for complex group action
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/b978-0-934613-63-7.50023-1openalex-snapshot
A Theory of Action for MultiAgent Planning
inferredcites →https://doi.org/10.1016/s0304-3975(96)00251-4openalex-snapshot
Notes on the methodology of CCS and CSP
inferredcites →https://doi.org/10.1109/21.135682openalex-snapshot
Coordination as distributed search in a hierarchical behavior space
inferredcites →https://doi.org/10.1111/j.1467-8640.1990.tb00126.xopenalex-snapshot
Formalizing planning knowledge for hierarchical planning
inferredcites →https://doi.org/10.1111/j.1467-8640.1990.tb00297.xopenalex-snapshot
Can AI planners solve practical problems?
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/301136.301205openalex-snapshot
Top-down search for coordinating the hierarchical plans of multiple agents
inferredcites →https://doi.org/10.1145/800070.802190openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1145/860575.860621openalex-snapshot
Discovering and exploiting synergy between hierarchical planning agents
inferredcites →https://doi.org/10.1145/860620.860621openalex-snapshot
Discovering and exploiting synergy between hierarchical planning agents
inferredcites →https://doi.org/10.1609/aimag.v15i4.1109openalex-snapshot
An Introduction to Least Commitment Planning
inferredcites →https://doi.org/10.1609/aimag.v20i4.1478openalex-snapshot
Coordinating a Distributed Planning System
inferredcites →https://doi.org/10.6028/nist.ir.7348openalex-snapshot
Interprocess communication in the process specification language
inferredcites →https://doi.org/10.7551/mitpress/5803.001.0001openalex-snapshot
Reasoning About Knowledge
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45622-8openalex-snapshot
Abstraction, Reformulation, and Approximation
inferred← citeshttps://doi.org/10.1007/978-1-4614-8806-4_50openalex-snapshot
Distributed Intelligent Agent Algorithms in Human Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-66534-0_10openalex-snapshot
The Intention Progression Competition
inferred← citeshttps://doi.org/10.1007/978-3-319-14484-9_2openalex-snapshot
Keeping a Clear Separation between Goals and Plans
inferred← citeshttps://doi.org/10.1007/978-3-319-50983-9_10openalex-snapshot
Reasoning About the Executability of Goal-Plan Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-28939-2_3openalex-snapshot
Towards Reasoning with Partial Goal Satisfaction in Intelligent Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-31915-0_1openalex-snapshot
Logical Foundations for a Rational BDI Agent Programming Language (Extended Version)
inferred← citeshttps://doi.org/10.1007/s10458-009-9086-9openalex-snapshot
Coordination by design and the price of autonomy
inferred← citeshttps://doi.org/10.1007/s10458-010-9130-9openalex-snapshot
A BDI agent programming language with failure handling, declarative goals, and planning
inferred← citeshttps://doi.org/10.1007/s10458-015-9293-5openalex-snapshot
Improving domain-independent intention selection in BDI systems
inferred← citeshttps://doi.org/10.1007/s10458-020-09462-xopenalex-snapshot
Teammate-pattern-aware autonomy based on organizational self-design principles
inferred← citeshttps://doi.org/10.1007/s42113-026-00335-2openalex-snapshot
A Computational Model of Backward Reasoning in Human Problem Solving
inferred← citeshttps://doi.org/10.1016/j.artint.2012.08.005openalex-snapshot
On the complexity of planning for agent teams and its implications for single agent planning
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.04.063openalex-snapshot
Partially centralized approach for dynamic hierarchical-plans merging
inferred← citeshttps://doi.org/10.1109/access.2024.3390796openalex-snapshot
Incorporating Online Learning Into MCTS-Based Intention Progression
inferred← citeshttps://doi.org/10.1109/aero.2009.4839709openalex-snapshot
Peer-to-peer planning for space mission control
inferred← citeshttps://doi.org/10.1109/compsac61105.2024.00013openalex-snapshot
Verifying Multi -Agent Coordination Correctness for BDI Agents
inferred← citeshttps://doi.org/10.1109/ictai.2018.00071openalex-snapshot
A Framework for Plan Library Evolution in BDI Agent Systems
inferred← citeshttps://doi.org/10.1109/iros60139.2025.11247212openalex-snapshot
ACoL: From Abstractions to Grounded Languages for Robust Coordination of Task Planning Robots
inferred← citeshttps://doi.org/10.1109/wiiat.2008.389openalex-snapshot
Planning for Coordination and Coordination for Planning
inferred← citeshttps://doi.org/10.14201/adcaij201762517openalex-snapshot
A Multi-Agent Extension of a Hierarchical Task Network Planning Formalism
inferred← citeshttps://doi.org/10.1504/ijaose.2022.122640openalex-snapshot
Quantifying the progress of goals in intelligent agents
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17414openalex-snapshot
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15966openalex-snapshot
Decentralized Refinement Planning and Acting
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27209openalex-snapshot
Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks
inferred← citeshttps://doi.org/10.1609/socs.v16i1.27284openalex-snapshot
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements
inferred← citeshttps://doi.org/10.1613/jair.1.16997openalex-snapshot
Decentralized, Decomposition-Based Observation Scheduling for a Large-Scale Satellite Constellation
inferred← citeshttps://doi.org/10.1613/jair.2479openalex-snapshot
Refining the Execution of Abstract Actions with Learned Action Models
inferred← citeshttps://doi.org/10.1613/jair.3840openalex-snapshot
Distributed Reasoning for Multiagent Simple Temporal Problems
inferred← citeshttps://doi.org/10.22146/ijccs.2143openalex-snapshot
Reduksi Parameter Quality-Of-Service Menggunakan Rough-Set-Theory Dalam Simulasi Routing Algoritma Dijkstra
inferred← citeshttps://doi.org/10.24963/ijcai.2021/19openalex-snapshot
Multi-Agent Intention Progression with Black-Box Agents
inferred← citeshttps://doi.org/10.3233/mgs-170264openalex-snapshot
Dynamic verification of hierarchical multi-agent plans
inferred← citeshttps://doi.org/10.3233/mgs-2009-0133openalex-snapshot
Introduction to planning in multiagent systems
inferred← citeshttps://doi.org/10.4018/jats.2013040101openalex-snapshot
Hierarchical Multi-Agent Plans Using Model-Based Petri Net
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.