Forward checking and intelligent backtracking

DOI10.1016/0020-0190(89)90035-5zbMath0688.68048OpenAlexW2048954164MaRDI QIDQ1263983

D. A. Wolfram

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90035-5

zbMATH Keywords

computational complexityforward checkingintelligent backtrackingsearch rearrangement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)

Related Items (1)

Propositional SAT Solving

Cites Work

• An execution model for exploiting AND-parallelism in logic programs
• Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
• Consistency in networks of relations
• Intractable unifiability problems and backtracking

This page was built for publication: Forward checking and intelligent backtracking