Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems

DOI10.1007/978-3-540-73817-6_10MaRDI QIDQ3608451zbMATHOpenAlexFDO

Authors Igor Razgon, Barry O'Sullivan

Publication date 5 March 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-73817-6_10

Mathematics Subject Classification ID

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

Recommendations

• Learning cluster-based structure to solve constraint satisfaction problems
• scientific article; zbMATH DE number 1234562
• Constraint processing. Proceedings of workshops held in conjunction with the international congress on computer systems and applied mathematics (CSAM '93) in St. Petersburg, Russia and the European conference on artificial intelligence (ECAI '94) held in
• scientific article; zbMATH DE number 67482
• Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems

Cited in

(3)

• scientific article; zbMATH DE number 2080335 (Why is no real title available?)
• Learning cluster-based structure to solve constraint satisfaction problems
• Tree clustering for constraint networks

This page was built for publication: Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems

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