Decision network semantics of branching constraint satisfaction problems

DOI10.1007/B11792MaRDI QIDQ5900634zbMATH OpenOpenAlexFDO

Authors Kenneth N. Brown, Peter Lucas, David W. Fowler

Publication date 6 April 2010

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

Full work available at URL https://doi.org/10.1007/b11792

Mathematics Subject Classification ID

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

Recommendations

• Branching constraint satisfaction problems and Markov decision problems compared
• scientific article; zbMATH DE number 2080330
• scientific article; zbMATH DE number 1322794
• A probabilistic analysis of randomly generated binary constraint satisfaction problems.
• The logic of constraint satisfaction

Cited in

(5)

• Branching constraint satisfaction problems and Markov decision problems compared
• Learning to select branching rules in the DPLL procedure for satisfiability
• scientific article; zbMATH DE number 1322794 (Why is no real title available?)
• scientific article; zbMATH DE number 2080330 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Decision network semantics of branching constraint satisfaction problems

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