On the public citation graph

Conformant Planning via Symbolic Model Checking

0 signed · 53 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/10720246_1openalex-snapshot
Planning as Model Checking
inferred← citeshttps://doi.org/10.1007/11546207_14openalex-snapshot
An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant Planning
inferred← citeshttps://doi.org/10.1007/11574620_6openalex-snapshot
Towards a Formal Verification of OWL-S Process Models
inferred← citeshttps://doi.org/10.1007/11881216_33openalex-snapshot
Mapping Conformant Planning into SAT Through Compilation and Projection
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_22openalex-snapshot
Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_7openalex-snapshot
Symbolic Heuristic Search Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_16openalex-snapshot
Answer Set Planning under Action Costs
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_3openalex-snapshot
Symbolic Techniques in Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/978-1-84800-094-0_24openalex-snapshot
Recovery from Plan Failures in Partially Observable Environments
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_9openalex-snapshot
Behavioral QLTL
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_12openalex-snapshot
deon-$$\mathcal {B}$$: A Language for Well-Founded Deontic Planning
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_31openalex-snapshot
Driving by Disproof: A Practical Model Checking Approach to Fleet Coordination
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_22openalex-snapshot
Planning with Preferences Using Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-31846-0_10openalex-snapshot
A Formal Approach for the Modelling and Verification of Multiagent Plans Based on Model Checking and Petri Nets
inferred← citeshttps://doi.org/10.1007/s10115-012-0525-6openalex-snapshot
Reduced ordered binary decision diagram with implied literals: a new knowledge compilation approach
inferred← citeshttps://doi.org/10.1007/s10115-023-01976-6openalex-snapshot
Cyclic Action Graphs for goal recognition problems with inaccurately initialised fluents
inferred← citeshttps://doi.org/10.1007/s10458-025-09712-wopenalex-snapshot
Behavioral QLTL
inferred← citeshttps://doi.org/10.1007/s10472-016-9517-7openalex-snapshot
Fast strong planning for fully observable nondeterministic planning problems
inferred← citeshttps://doi.org/10.1007/s10703-008-0052-yopenalex-snapshot
The symbolic OBDD scheme for generating mechanical assembly sequences
inferred← citeshttps://doi.org/10.1007/s10796-013-9464-3openalex-snapshot
Failure recovery in distributed model composition with intelligent assistance
inferred← citeshttps://doi.org/10.1007/s10817-005-9009-7openalex-snapshot
Symbolic Techniques in Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/s11432-013-4854-1openalex-snapshot
Proof systems for planning under 0-approximation semantics
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.2006.01.003openalex-snapshot
Conformant planning via heuristic forward search: A new approach
inferred← citeshttps://doi.org/10.1016/j.artint.2006.01.004openalex-snapshot
Strong planning under partial observability
inferred← citeshttps://doi.org/10.1016/j.artint.2007.05.009openalex-snapshot
State-set branching: Leveraging BDDs for heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.007openalex-snapshot
Approximation of action theories and its application to conformant planning
inferred← citeshttps://doi.org/10.1016/j.artint.2015.06.001openalex-snapshot
A generic approach to planning in the presence of incomplete information: Theory and implementation
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103271openalex-snapshot
CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement
inferred← citeshttps://doi.org/10.1016/j.engappai.2020.104091openalex-snapshot
GRAVITAS: A model checking based planning and goal reasoning framework for autonomous systems
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103300openalex-snapshot
Model checking with memoisation for fast overtaking planning
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00367-3openalex-snapshot
A logic programming approach to knowledge-state planning, II: The system
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00374-0openalex-snapshot
Weak, strong, and strong cyclic planning via symbolic model checking
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00375-2openalex-snapshot
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
inferred← citeshttps://doi.org/10.1016/s0065-2458(05)65004-8openalex-snapshot
Verification and Validation and Artificial Intelligence
inferred← citeshttps://doi.org/10.1017/s1471068406002948openalex-snapshot
Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068422000072openalex-snapshot
Answer Set Planning: A Survey
inferred← citeshttps://doi.org/10.1061/41139(387)477openalex-snapshot
State-Action Pairs Reduction for Weak Planning via State Reachability
inferred← citeshttps://doi.org/10.1093/logcom/exx020openalex-snapshot
More for free: a dynamic epistemic framework for conformant planning over transition systems*
inferred← citeshttps://doi.org/10.1109/icdh.2012.43openalex-snapshot
Strong Planning Revisited
inferred← citeshttps://doi.org/10.1109/ictai.2017.00026openalex-snapshot
A Distributed Logical Filter for Connected Row Convex Constraints
inferred← citeshttps://doi.org/10.1109/iros.2015.7353743openalex-snapshot
Robust trajectory selection for rearrangement planning as a multi-armed bandit problem
inferred← citeshttps://doi.org/10.1109/lra.2019.2899931openalex-snapshot
Asymptotically Near-Optimal Methods for Kinodynamic Planning With Initial State Uncertainty
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/robio.2007.4522474openalex-snapshot
Recent advances in conformant planning
inferred← citeshttps://doi.org/10.1109/tro.2018.2830353openalex-snapshot
Resilient, Provably-Correct, and High-Level Robot Behaviors
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2012.00444.xopenalex-snapshot
ACTION FAILURE RECOVERY VIA MODEL‐BASED DIAGNOSIS AND CONFORMANT PLANNING
inferred← citeshttps://doi.org/10.1145/976706.976708openalex-snapshot
A logic programming approach to knowledge-state planning
inferred← citeshttps://doi.org/10.3182/20121003-3-mx-4033.00058openalex-snapshot
Explicit Storage and Analysis of Billions of States using Commodity Computers
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04289openalex-snapshot
Conformant Planning Based on Reducing Belief States
inferred← citeshttps://doi.org/10.4204/eptcs.215.21openalex-snapshot
A Dynamic Epistemic Framework for Conformant Planning
inferred← citeshttps://doi.org/10.70675/6601c7deza7f1z464bzbd28z88b10567bd6copenalex-snapshot
Probabilistic Decision-Making Models for Multi-Agent Systems and Human-Robot Collaboration
inferred← citeshttps://doi.org/10.70675/cdadc6e7z0b44z4b04zb643zd34354c03907openalex-snapshot
Knowledge compilation for nondeterministic action languages
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.