Simple dynamic logic with parallel composition and applications to planning
From MaRDI portal
Cites work
- A dynamic logic for acting, sensing, and planning
- A lightweight epistemic logic and its application to planning
- A simple account of multi-agent epistemic planning
- Blocks World revisited
- Concurrent dynamic logic
- Dynamic logic of propositional assignments: a well-behaved variant of PDL
- Fast planning through planning graph analysis
- Iteration-free \(\mathrm{PDL}\) with storing, recovering and parallel composition: a complete axiomatization
- On the revision of planning tasks
- Parallel action: Concurrent dynamic logic with independent modalities
- PDL for structured data: a graph-calculus approach
- PDL with intersection of programs: a complete axiomatization
- Planning as satisfiability: parallel plans and algorithms for plan search
- Propositional dynamic logic with storing, recovering and parallel composition
- Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator
- Resource separation in dynamic logic of propositional assignments
- Resource separation in dynamic logic of propositional assignments
- The complexity of PDL with interleaving
- The computational complexity of propositional STRIPS planning
This page was built for publication: Simple dynamic logic with parallel composition and applications to planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849509)
