On forward checking for non-binary constraint satisfaction

DOI10.1007/978-3-540-48085-3_7MaRDI QIDQ4495107zbMATH OpenFDO

Authors Christian Bessiere, Eugene C. Freuder, Javier Larrosa, P. Meseguer

Publication date 10 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10261/160964

zbMATH Keywords

non-binary constraint satisfaction problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On forward checking for non-binary constraint satisfaction.
• scientific article; zbMATH DE number 2080297
• Binary vs. non-binary constraints
• scientific article; zbMATH DE number 2084714
• Decomposable constraints

Cited in

(10)

• Backtracking algorithms for disjunctions of temporal constraints
• Decomposable constraints
• On forward checking for non-binary constraint satisfaction.
• Combining preorder and postorder resolution in a satisfiability solver
• scientific article; zbMATH DE number 2080297 (Why is no real title available?)
• scientific article; zbMATH DE number 2084704 (Why is no real title available?)
• scientific article; zbMATH DE number 2084714 (Why is no real title available?)
• A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems
• scientific article; zbMATH DE number 2243409 (Why is no real title available?)
• Efficient solution techniques for disjunctive temporal reasoning problems

This page was built for publication: On forward checking for non-binary constraint satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495107)