CSPs with counters: a likelihood-based heuristic

DOI10.1080/095281398146950MaRDI QIDQ4420778zbMATH OpenOpenAlexWikidataFDO

Authors Gadi Solotorevsky, Solomon E. Shimony, Amnon Meisels

Publication date 2 November 2003

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/095281398146950

Mathematics Subject Classification ID

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

Recommendations

• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Solution counting algorithms for constraint-centered search heuristics
• Counting-based search: branching heuristics for constraint satisfaction problems
• Using SAT encodings to derive CSP value ordering heuristics
• Counting Solutions of Knapsack Constraints

Cited in

(3)

• Distributed personnel scheduling -- negotiation among scheduling agents
• Iterative restart technique for solving timetabling problems.
• A non-binary constraint ordering heuristic for constraint satisfaction problems

This page was built for publication: CSPs with counters: a likelihood-based heuristic

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