On the public citation graph

The Automatic Inference of State Invariants in TIM

0 signed · 111 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.1007/3-540-63912-8_92openalex-snapshot
Extending planning graphs to an ADL subset
inferredcites →https://doi.org/10.1007/978-1-4471-3164-9_7openalex-snapshot
Automatically Derived Heuristics for Planning Search
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/s0004-3702(97)00035-0openalex-snapshot
An event driven integration reasoning scheme for handling dynamic threats in an unstructured environment
inferredcites →https://doi.org/10.1016/s0736-5853(86)80074-0openalex-snapshot
Artificial Intelligence: An Introductory Course
inferredcites →https://doi.org/10.1613/jair.316openalex-snapshot
Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning
inferredcites →https://doi.org/10.1613/jair.570openalex-snapshot
Efficient Implementation of the Plan Graph in STAN
inferredcites →https://doi.org/10.21236/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
inferredcites →https://doi.org/10.26481/dis.19960307tgopenalex-snapshot
Inductive learning of knowledge-based planning operators

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferred← citeshttps://doi.org/10.1007/10720246_12openalex-snapshot
Action Constraints for Planning
inferred← citeshttps://doi.org/10.1007/10720246_5openalex-snapshot
Exploiting Competitive Planner Performance
inferred← citeshttps://doi.org/10.1007/11504894-30openalex-snapshot
Plan execution in dynamic environments
inferred← citeshttps://doi.org/10.1007/11504894_30openalex-snapshot
Plan Execution in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/11551263_22openalex-snapshot
Controlled Reachability Analysis in AI Planning: Theory and Practice
inferred← citeshttps://doi.org/10.1007/11730095_21openalex-snapshot
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
inferred← citeshttps://doi.org/10.1007/11871842_17openalex-snapshot
Improving Control-Knowledge Acquisition for Planning by Active Learning
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_82openalex-snapshot
STeLLa v2.0: Planning with Intermediate Goals
inferred← citeshttps://doi.org/10.1007/3-540-39963-1_64openalex-snapshot
Knowledge Representation in Planning: A PDDL to OCL h Translation
inferred← citeshttps://doi.org/10.1007/3-540-44886-1_42openalex-snapshot
Learning General Graphplan Memos through Static Domain Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45329-6_40openalex-snapshot
STeLLa: An Optimal Sequential and Parallel Planner
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_2openalex-snapshot
Reformulation in Planning
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_4openalex-snapshot
Temporal Planning through Mixed Integer Programming: A Preliminary Report
inferred← citeshttps://doi.org/10.1007/3-540-48050-1_58openalex-snapshot
A Tool Supported Structured Method for Planning Domain Acquisition
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_8openalex-snapshot
Encoding Domain and Control Knowledge for Propositional Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-06483-3_20openalex-snapshot
A Comparison of h 2 and MMM for Mutex Pair Detection Applied to Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-30202-5_30openalex-snapshot
Knowledge Formulation for AI Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_11openalex-snapshot
A Case Base Seeding for Case-Based Planning Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71986-1_24openalex-snapshot
Model-Based Chemical Compound Formulation
inferred← citeshttps://doi.org/10.1007/978-3-540-72960-0_9openalex-snapshot
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-74141-1_10openalex-snapshot
Using Cases Utility for Heuristic Planning Improvement
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_3openalex-snapshot
Computing Domain Specific Information
inferred← citeshttps://doi.org/10.1007/s10458-021-09501-1openalex-snapshot
Automated narrative planning model extension
inferred← citeshttps://doi.org/10.1007/s10472-019-09618-wopenalex-snapshot
Discovering state constraints for planning with conditional effects in Discoplan (part I)
inferred← citeshttps://doi.org/10.1007/s10489-012-0404-6openalex-snapshot
A case-based approach to heuristic planning
inferred← citeshttps://doi.org/10.1007/s10703-013-0197-1openalex-snapshot
Model checking approach to automated planning
inferred← citeshttps://doi.org/10.1016/b978-155860856-6/50038-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.artint.2004.05.003openalex-snapshot
Conformant planning via symbolic model checking and heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2005.04.001openalex-snapshot
Processes and continuous change in a SAT-based planner
inferred← citeshttps://doi.org/10.1016/j.artint.2008.10.013openalex-snapshot
Concise finite-domain representations for PDDL planning tasks
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.004openalex-snapshot
Long-distance mutual exclusion for planning
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferred← citeshttps://doi.org/10.1016/j.artint.2010.05.003openalex-snapshot
Property persistence in the situation calculus
inferred← citeshttps://doi.org/10.1016/j.artint.2010.07.007openalex-snapshot
Kernel functions for case-based planning
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.artint.2018.01.004openalex-snapshot
Extracting mutual exclusion invariants from lifted temporal planning domains
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103221openalex-snapshot
An Introduction to the Planning Domain Definition Language (PDDL): Book review
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104097openalex-snapshot
Generalized planning as heuristic search: A new planning search-space that leverages pointers over objects
inferred← citeshttps://doi.org/10.1016/j.engappai.2013.04.006openalex-snapshot
Post-design analysis for building and refining AI planning systems
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00082-0openalex-snapshot
Least commitment in Graphplan
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00122-9openalex-snapshot
Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00158-8openalex-snapshot
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
inferred← citeshttps://doi.org/10.1017/s0269888907001063openalex-snapshot
Planning domain definition using GIPO
inferred← citeshttps://doi.org/10.1017/s0269888912000422openalex-snapshot
Acquiring planning domain models using LOCM
inferred← citeshttps://doi.org/10.1017/s0269888923000097openalex-snapshot
Reformulation techniques for automated planning: a systematic review
inferred← citeshttps://doi.org/10.1080/0952813x.2012.660991openalex-snapshot
Computing higher order exclusion relations in propositional planning
inferred← citeshttps://doi.org/10.1109/fskd.2007.593openalex-snapshot
Translating PDDL Tasks into Multi-valued Conformant Planning Tasks
inferred← citeshttps://doi.org/10.1109/iceccs20050.2012.6299219openalex-snapshot
Translating PDDL into CSP# - The PAT Approach
inferred← citeshttps://doi.org/10.1109/indicon.2016.7838899openalex-snapshot
Framework and tool support to design high quality domain models for intelligent systems
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981801openalex-snapshot
Hybrid Discrete-Continuous Path Planning for Lattice Traversal
inferred← citeshttps://doi.org/10.1109/ncis.2011.43openalex-snapshot
Auxiliary Algorithms in Green Multi-agent Planning Framework
inferred← citeshttps://doi.org/10.11606/t.3.2011.tde-11042011-074633openalex-snapshot
Análise de pós-design para aplicações de planejamento em IA.
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8644openalex-snapshot
Red-Black Relaxed Plan Heuristics
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11030openalex-snapshot
Schematic Invariants by Reduction to Ground Invariants
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6534openalex-snapshot
A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/aiide.v5i1.12357openalex-snapshot
Bowyer: A Planning Tool for Bridging the Gap between Declarative and Procedural Domains
inferred← citeshttps://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI Planning
inferred← citeshttps://doi.org/10.1609/aimag.v24i2.1705openalex-snapshot
Learning-assisted automated planning: looking back, taking stock, going forward
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13391openalex-snapshot
Acquisition of Object-Centred Domain Models from Planning Examples
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13469openalex-snapshot
Where Ignoring Delete Lists Works, Part II: Causal Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13476openalex-snapshot
Generalised Domain Model Acquisition from Action Traces
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13620openalex-snapshot
Fully Automated Cyclic Planning for Large-Scale Manufacturing Domains
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13650openalex-snapshot
Heuristic Evaluation Based on Lifted Relaxed Planning Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13703openalex-snapshot
Solving Large-Scale Planning Problems by Decomposition and Macro Generation
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13708openalex-snapshot
A Reminder about the Importance of Computing and Exploiting Invariants in Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13751openalex-snapshot
Practical Undoability Checking via Contingent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13870openalex-snapshot
Learning STRIPS Action Models with Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19784openalex-snapshot
Detecting Unsolvability Based on Separating Functions
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27186openalex-snapshot
Operator Pruning Using Lifted Mutex Groups via Compilation on Lifted Level
inferred← citeshttps://doi.org/10.1613/jair.1135openalex-snapshot
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems
inferred← citeshttps://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferred← citeshttps://doi.org/10.1613/jair.1477openalex-snapshot
Using Memory to Transform Search on the Planning Graph
inferred← citeshttps://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferred← citeshttps://doi.org/10.1613/jair.5249openalex-snapshot
Tie-Breaking Strategies for Cost-Optimal Best First Search
inferred← citeshttps://doi.org/10.1613/jair.5321openalex-snapshot
Fact-Alternating Mutex Groups for Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.570openalex-snapshot
Efficient Implementation of the Plan Graph in STAN
inferred← citeshttps://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferred← citeshttps://doi.org/10.1613/jair.754openalex-snapshot
Planning by Rewriting
inferred← citeshttps://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.893openalex-snapshot
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning
inferred← citeshttps://doi.org/10.18725/oparu-1765openalex-snapshot
Hierarchical landmarks - a means to reduce search effort in hybrid planning
inferred← citeshttps://doi.org/10.21236/ada455023openalex-snapshot
A General Approach to Synthesize Problem-Specific Planners
inferred← citeshttps://doi.org/10.21236/ada550542openalex-snapshot
Plan Representations for Distributed Planning and Execution
inferred← citeshttps://doi.org/10.21954/ou.ro.0000fd8copenalex-snapshot
Pre-processing planning domains containing language axioms
inferred← citeshttps://doi.org/10.24059/olj.v15i1.185openalex-snapshot
Cloud-Based Technologies: Faculty Development, Support, and Implementation
inferred← citeshttps://doi.org/10.24963/ijcai.2020/566openalex-snapshot
Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-229openalex-snapshot
Landmarks in Hierarchical Planning
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-341openalex-snapshot
Iterative Bounding LAO*
inferred← citeshttps://doi.org/10.3233/978-1-60750-676-8-238openalex-snapshot
Domain Independent Goal Recognition
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-2010-0473openalex-snapshot
A weighted CSP approach to cost-optimal planning
inferred← citeshttps://doi.org/10.3233/mgs-2009-0135openalex-snapshot
Quantifying privacy in multiagent planning
inferred← citeshttps://doi.org/10.4018/978-1-59140-450-7.ch004openalex-snapshot
Plan Optimization by Plan Rewriting
inferred← citeshttps://doi.org/10.4018/978-1-60960-818-7.ch510openalex-snapshot
Improving Automated Planning with Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01886openalex-snapshot
Extracting Lifted Mutual Exclusion Invariants from Temporal Planning Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1711.05105openalex-snapshot
An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12071openalex-snapshot
Guarantees for Sound Abstractions for Generalized Planning (Extended Paper)
inferred← citeshttps://doi.org/10.5555/2772879.2773349openalex-snapshot
Automated Extension of Narrative Planning Domains with Antonymic Operators
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-324openalex-snapshot
Planning under partial observability by classical replanning: theory and experiments
inferred← citeshttps://doi.org/10.70675/63f10ce2z26faz4efcz963dz9a15dea53615openalex-snapshot
Décomposition des jeux dans le domaine du General Game Playing.
inferred← citeshttps://doi.org/10.82465/6593openalex-snapshot
Mutex Pair Detection for Improving Abstraction-based Heuristics
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.