Pages that link to "Item:Q2457605"
From MaRDI portal
The following pages link to Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605):
Displayed 18 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP (Q2055805) (← links)
- SAT competition 2020 (Q2060693) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Representing and planning with interacting actions and privacy (Q2287194) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- ASP Solving for Expanding Universes (Q3449219) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning (Q5870537) (← links)