Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems

DOI10.1007/978-3-540-73817-6_10zbMATH Open1176.68203OpenAlexW1603537144MaRDI QIDQ3608451FDOQ3608451

Barry O'Sullivan, Igor Razgon

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

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
• Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Tree clustering for constraint networks
• Learning cluster-based structure to solve constraint satisfaction problems

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)