scientific article

zbMath0990.90543MaRDI QIDQ2741536

Michael L. Littman, Michail G. Lagoudakis

Publication date: 24 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

DPLL procedurecomplete satisfiability (SAT) solver

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Machine learning and logic: a new frontier in artificial intelligence ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem ⋮ Learning Rate Based Branching Heuristic for SAT Solvers

Cites Work

• Branching rules for satisfiability
• The Complexity of Enumeration and Reliability Problems
• A machine program for theorem-proving
• Unnamed Item
• Unnamed Item

This page was built for publication: