scientific article; zbMATH DE number 1113993

MaRDI QIDQ4375758zbMATHFDO

Authors G. Neil Haven, Paul Walton jun. Purdom

Publication date 25 May 1998

zbMATH Keywords

constraint satisfaction problemsprobe order backtracking

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10) 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

(16)

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

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)