Learning-Based Abstractions for Nonlinear Constraint Solving Sumanth Dathathri ∗1 , Nikos Arechiga2 , Sicun Gao3 , and Richard M. Murray1 1 Computing and Mathematical Sciences, California Institute of Technology 2

First Page		Document Content
Date: 2018-09-27 16:37:21 Constraint programming Mathematical optimization Theoretical computer science Statistical classification Artificial intelligence Machine learning Support vector machine Constraint satisfaction problem Constraint satisfaction Decomposition method Constrained optimization Constraint		Learning-Based Abstractions for Nonlinear Constraint Solving Sumanth Dathathri ∗1 , Nikos Arechiga2 , Sicun Gao3 , and Richard M. Murray1 1 Computing and Mathematical Sciences, California Institute of Technology 2 Add to Reading List Source URL: scungao.github.io Download Document from Source Website File Size: 286,91 KB Share Document on Facebook

	1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP) DocID: 1ukgD - View Document
	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester DocID: 1ruap - View Document
	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel DocID: 1rm3f - View Document
	Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo DocID: 1rliX - View Document