scientific article; zbMATH DE number 1113993

zbMATH Open0887.68019MaRDI QIDQ4375758FDOQ4375758

Authors: G. Neil Haven, Paul Walton jun. Purdom 

Publication date: 25 May 1998

Title of this publication is not available (Why is that?)

Recommendations

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

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)

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
• Title not available (Why is that?)
• A theoretical evaluation of selected backtracking algorithms.
• Amortized random backtracking
• Quasiconvex analysis of backtracking algorithms
• Trail saving on backtrack
• An analysis of backtrack-free algorithms on a constraint satisfaction problem with growing domains
• A fast parallel SAT-solver -- efficient workload balancing
• A Variational Method for Analysing Unit Clause Search
• A BDD SAT solver for satisfiability testing: An industrial case study

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)