Backdoors in the Context of Learning

DOI10.1007/978-3-642-02777-2_9zbMath1247.68250OpenAlexW1559732456MaRDI QIDQ3637159

Ashish Sabharwal, Bistra Dilkina, Carla P. Gomes

Publication date: 7 July 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-642-02777-2_9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Learning pseudo-backdoors for mixed integer programs ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ Backdoors for linear temporal logic ⋮ Backdoors into heterogeneous classes of SAT and CSP

Uses Software

• SATLIB
• Chaff

Cites Work

• Unnamed Item
• SATLIB
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
• Backdoor sets for DLL subsolvers
• Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
• Tradeoffs in the Complexity of Backdoor Detection
• Backdoors to Combinatorial Optimization: Feasibility and Optimality

This page was built for publication: Backdoors in the Context of Learning