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

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)

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

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)