scientific article; zbMATH DE number 3303642
From MaRDI portal
Publication:5585003
Cited in
(10)- Game tree searching by min/max approximation
- Using rewriting rules for connection graphs to prove theorems
- Completely non-clausal theorem proving
- Generalized AND/OR graphs
- DATAPLAN: An interface generator for database semantics
- Problem representations and formal properties of heuristic search
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- Best-first minimax search
- LAO*: A heuristic search algorithm that finds solutions with loops
- General branch and bound, and its relation to A^* and AO^*
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585003)
