scientific article; zbMATH DE number 1113993

MaRDI QIDQ4375758zbMATH OpenFDO

Authors G. Neil Haven, Paul Walton jun. Purdom

Publication date 25 May 1998

zbMATH Keywords

constraint satisfaction problemsprobe order backtracking

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Probe Order Backtracking
• Backtracking and random constraint satisfaction
• Average Time Analysis of Clause Order Backtracking
• Polynomial-average-time satisfiability problems

Cited in

(18)

• Forward checking and intelligent backtracking
• A BDD SAT solver for satisfiability testing: An industrial case study
• A fast parallel SAT-solver -- efficient workload balancing
• A theoretical evaluation of selected backtracking algorithms.
• Amortized random backtracking
• The Multi-SAT algorithm
• Backing backtracking
• Trail saving on backtrack
• scientific article; zbMATH DE number 30299 (Why is no real title available?)
• Average Time Analysis of Clause Order Backtracking
• Probe Order Backtracking
• scientific article; zbMATH DE number 2159023 (Why is no real title available?)
• A Variational Method for Analysing Unit Clause Search
• Backjumping is Exception Handling
• An analysis of backtrack-free algorithms on a constraint satisfaction problem with growing domains
• Quasiconvex analysis of backtracking algorithms
• Formal Concept Analysis
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

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 Q4375758)