Backtracking Search
← Back to Logic Programming
A search strategy where the system explores possible solutions by trying choices and undoing (backtracking) when a dead end is reached. Prolog-style resolution uses backtracking to systematically search the space of possible proofs.