Structured learning modulo theories

DOI10.1016/j.artint.2015.04.002zbMath1404.68121arXiv1405.1675OpenAlexW2158797600MaRDI QIDQ511777

Roberto Sebastiani, Stefano Teso, Andrea Passerini

Publication date: 22 February 2017

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

Full work available at URL: https://arxiv.org/abs/1405.1675

zbMATH Keywords

satisfiability modulo theoryconstructive machine learninglearning with constraintsoptimization modulo theorystructured-output support vector machines

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

Learning MAX-SAT from contextual examples for combinatorial optimisation ⋮ Learning modulo theories for constructive preference elicitation ⋮ Automatic synthesis of constraints from examples using mixed integer linear programming ⋮ Ellipsoidal one-class constraint acquisition for quadratically constrained programming ⋮ Delegatable Functional Signatures ⋮ Learning relational dependency networks in hybrid domains ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories

Uses Software

• ProbLog
• SYMBA
• Church
• MathSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of relaxations for linear generalized disjunctive programming
• Bridging logic and kernel machines
• Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5--9, 2011. Proceedings, Part II
• Cutting-plane training of structural SVMs
• On probabilistic inference by weighted model counting
• Solving Non-linear Arithmetic
• Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
• Optimization Modulo Theories with Linear Rational Costs
• Extending ProbLog with Continuous Distributions
• The magic of logical inference in probabilistic programming
• Compiling constraints in clp(FD)
• Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
• Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
• Satisfiability Modulo the Theory of Costs: Foundations and Applications
• Disjunctive Programming
• Mixed Integer Programming Computation
• Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
• Computing layouts with deformable templates
• Inference in probabilistic logic programs with continuous random variables
• Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
• Model Evolution with Equality Modulo Built-in Theories
• A Modular Approach to MaxSAT Modulo Theories
• Symbolic optimization with SMT solvers
• A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
• On SAT Modulo Theories and Optimization Problems

This page was built for publication: Structured learning modulo theories