Constraint learning: an appetizer

DOI10.1007/978-3-030-31423-1_7MaRDI QIDQ6535988

Stefano Teso

Publication date: 14 March 2024

zbMATH Keywords

constraint satisfactionmachine learningconstraint optimizationinteractive learning

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preferences in artificial intelligence
• Structured learning modulo theories
• Integer linear programming for the Bayesian network structure learning problem
• Pegasos: primal estimated sub-gradient solver for SVM
• Algorithms for the maximum satisfiability problem
• Automatic synthesis of constraints from examples using mixed integer linear programming
• The many facets of linear programming
• Queries and concept learning
• Active Learning
• Optimization Modulo Theories with Linear Rational Costs
• A theory of the learnable
• Inductive Logic Programming: Theory and methods
• Optimization Methods for Large-Scale Machine Learning
• 10.1162/153244303322753698
• Theory of Disagreement-Based Active Learning
• Coactive Learning

This page was built for publication: Constraint learning: an appetizer

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