The following pages link to (Q4434167):
Displaying 11 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- Answer set based design of knowledge systems (Q854966) (← links)
- Proof systems for planning under 0-approximation semantics (Q893736) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Learning efficient logic programs (Q2425246) (← links)
- Domain-Independent Cost-Optimal Planning in ASP (Q5108526) (← links)
- (Q5701527) (← links)
- Optimal planning with expressive action languages as constraint optimization (Q6545569) (← links)