<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Theoretical computer science / Logic in computer science / Satisfiability modulo theories / Alt-Ergo / Modular arithmetic / Ring / Rewriting / Linear programming / First-order logic / Interval arithmetic
Date: 2017-07-21 11:03:15
Mathematics
Algebra
Theoretical computer science
Logic in computer science
Satisfiability modulo theories
Alt-Ergo
Modular arithmetic
Ring
Rewriting
Linear programming
First-order logic
Interval arithmetic

A Collaborative Framework for Non-Linear Integer Arithmetic Reasoning in Alt-Ergo Sylvain Conchon∗ Mohamed Iguernelala∗,∗∗ Alain Mebsout∗ ∗ LRI, Universit´

Add to Reading List

Source URL: mebsout.github.io

Download Document from Source Website

File Size: 373,06 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ †  David R. Cher

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document