Learning general constraints in CSP

DOI10.1016/j.artint.2016.06.002zbMath1385.68042OpenAlexW2438306999MaRDI QIDQ309921

Ofer Strichman, Michael Veksler

Publication date: 7 September 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.06.002

zbMATH Keywords

inference rulesconstraints solving

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 (2)

A first polynomial non-clausal class in many-valued logic ⋮ SUNNY-CP and the MiniZinc challenge

Uses Software

• MiniZinc
• Chaff
• CAMA
• CSP2SAT4J
• iZplus
• Mistral

Cites Work

• Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
• Propagation via lazy clause generation
• Cutting to the chase.
• Lazy Model Expansion: Interleaving Grounding with Search
• Learning General Constraints in CSP
• Fast and Flexible Difference Constraint Propagation for DPLL(T)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning general constraints in CSP