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):
Displaying 35 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)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- Boolean models and planning methods for parallel abstract programs (Q1003021) (← links)
- Planning parallel actions (Q1128648) (← 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)
- Iterative Plan Construction for the Workflow Satisfiability Problem (Q2938473) (← links)
- Encoding Domain Transitions for Constraint-Based Planning (Q2985114) (← links)
- Introducing Preferences in Planning as Satisfiability (Q3006114) (← links)
- Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms (Q3020421) (← links)
- Planning as satisfiability with IPC simple preferences and action costs (Q3164979) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- ASP Solving for Expanding Universes (Q3449219) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- Event Calculus Planning Through Satisfiability (Q4659507) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- Relaxing non-interference requirements in parallel plans (Q5018767) (← links)
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (Q5190260) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Logics in Artificial Intelligence (Q5394133) (← links)
- A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning (Q5870537) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)
- Optimal planning with expressive action languages as constraint optimization (Q6545569) (← links)