Learning modulo theories for constructive preference elicitation
From MaRDI portal
Publication:2238637
DOI10.1016/j.artint.2021.103454OpenAlexW3122866128MaRDI QIDQ2238637
Roberto Battiti, Andrea Passerini, Paolo Campigotto, Stefano Teso
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103454
preference elicitationconstructive machine learning(maximum) satisfiability modulo theorylearning while optimizing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preferences in artificial intelligence
- Structured learning modulo theories
- Multiobjective optimization. Interactive and evolutionary approaches
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Efficiently learning the preferences of people
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Active Learning
- Solving Non-linear Arithmetic
- Optimization Modulo Theories with Linear Rational Costs
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
- Satisfiability Modulo the Theory of Costs: Foundations and Applications
- Eliciting Single-Peaked Preferences Using Comparison Queries
- 10.1162/153244303322753751
- A Modular Approach to MaxSAT Modulo Theories
- Applications of Combinatorial Optimization
- On SAT Modulo Theories and Optimization Problems
- The Theory of Statistical Decision
- Discussion on boosting papers.