Pages that link to "Item:Q359984"
From MaRDI portal
The following pages link to Planning as satisfiability: heuristics (Q359984):
Displaying 11 items.
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- Two approximate algorithms for model counting (Q507433) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Progress in clasp Series 3 (Q3449220) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- Domain-Independent Cost-Optimal Planning in ASP (Q5108526) (← links)
