Structured Learning Modulo Theories

05/07/2014
by   Stefano Teso, et al.
0

Modelling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to model this kind of domains is crucial in "learning to design" tasks, that is, learning applications where the goal is to learn from examples how to perform automatic de novo design of novel objects. In this paper we present Structured Learning Modulo Theories, a max-margin approach for learning in hybrid domains based on Satisfiability Modulo Theories, which allows to combine Boolean reasoning and optimization over continuous linear arithmetical constraints. The main idea is to leverage a state-of-the-art generalized Satisfiability Modulo Theory solver for implementing the inference and separation oracles of Structured Output SVMs. We validate our method on artificial and real world scenarios.

READ FULL TEXT

page 26

page 35

page 36

page 37

research
02/18/2014

Hybrid SRL with Optimization Modulo Theories

Generally speaking, the goal of constructive learning could be seen as, ...
research
08/31/2020

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

We present new methods for solving the Satisfiability Modulo Theories pr...
research
08/18/2015

Learning Modulo Theories for preference elicitation in hybrid domains

This paper introduces CLEO, a novel preference elicitation algorithm cap...
research
04/30/2021

Temporal Stream Logic modulo Theories

Temporal Stream Logic (TSL) is a temporal logic that extends LTL with up...
research
05/07/2015

Structure Formation in Large Theories

Structuring theories is one of the main approaches to reduce the combina...
research
01/27/2016

Multi-Object Reasoning with Constrained Goal Models

Goal models have been widely used in Computer Science to represent softw...
research
08/06/2019

Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability

In this paper, we present a non-invasive reverse engineering attack base...

Please sign up or login with your details

Forgot password? Click here to reset