paper-with-me

Papers

Structured Learning Modulo Theories

2014-05-07 · Stefano Teso, Roberto Sebastiani, Andrea Passerini

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 {\em 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.

📄 PDF Abstract BibTeX arXiv:1405.1675

Code (1)

https://bitbucket.org/stefanoteso/pylmt

Similar Papers 제목 키워드 기반

Representing Hybrid Automata by Action Language Modulo Theories

2017-07-20 · Joohyung Lee, Nikhil Loney, Yunsong Meng

Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in …

Translation

Hybrid SRL with Optimization Modulo Theories

2014-02-18 · Stefano Teso, Roberto Sebastiani, Andrea Passerini

Generally speaking, the goal of constructive learning could be seen as, given an example set of structured objects, to generate novel objects with similar properties. From a statistical-relational learning (SRL) viewpoin…

Relational Reasoning

Answer Set Programming Modulo Theories and Reasoning about Continuous Changes

2025-07-06 · Joohyung Lee, Yunsong Meng arxiv

Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and S…

Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories

2017-09-04 · Rodrigo de Salvo Braz, Ciaran O'Reilly

Probabilistic Inference Modulo Theories (PIMT) is a recent framework that expands exact inference on graphical models to use richer languages that include arithmetic, equalities, and inequalities on both integers and rea…

10-shot image generation3D-Aware Image Synthesis

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)

2022-04-28 · Luca Geatti, Alessandro Gianola, Nicola Gigante

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. Th…