Constraint learning: an appetizer

DOI10.1007/978-3-030-31423-1_7MaRDI QIDQ6535988zbMATH OpenFDO

Authors Stefano Teso

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-31423-1_7

zbMATH Keywords

machine learningconstraint satisfactionconstraint 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)

Recommendations

• A statistical approach to learning constraints
• Learning Constraint Satisfaction Problems: An ILP Perspective
• Constraint acquisition
• Machine Learning
• Machine learning. A constraint-based approach

Cites work

• 10.1162/153244303322753698
• A theory of the learnable
• Active learning
• Algorithms for the maximum satisfiability problem
• Automatic synthesis of constraints from examples using mixed integer linear programming
• Coactive learning
• Handbook of constraint programming.
• Inductive Logic Programming: Theory and methods
• Integer linear programming for the Bayesian network structure learning problem
• Optimization methods for large-scale machine learning
• Optimization modulo theories with linear rational costs
• Pegasos: primal estimated sub-gradient solver for SVM
• Preferences in artificial intelligence
• Probabilistic graphical models.
• Queries and concept learning
• Scikit-learn: machine learning in Python
• Structured learning modulo theories
• The many facets of linear programming
• Theory of Disagreement-Based Active Learning

Cited in

(2)

• A statistical approach to learning constraints
• Automatic error function learning with interpretable compositional networks

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)