Next Article in Journal
An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets
Next Article in Special Issue
Online Adaptive Parameter Estimation for Quadrotors
Previous Article in Journal
Generalized Paxos Made Byzantine (and Less Complex)
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(9), 142; https://doi.org/10.3390/a11090142

Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method

1
School of Astronautics, Beihang University, Beijing 100191, China
2
Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China
3
Beijing Aerospace Control Center, Beijing 100094, China
4
Hubei Provincial Key Laboratory of Intelligent Robot, Wuhan Institute of Technology, Wuhan 430205, China
*
Author to whom correspondence should be addressed.
Received: 12 June 2018 / Revised: 12 September 2018 / Accepted: 14 September 2018 / Published: 18 September 2018
(This article belongs to the Special Issue Parameter Estimation Algorithms and Its Applications)
Full-Text   |   PDF [1199 KB, uploaded 18 September 2018]   |  

Abstract

The satisfiability modulo theories (SMT) problem is to decide the satisfiability of a logical formula with respect to a given background theory. This work studies the counting version of SMT with respect to linear integer arithmetic (LIA), termed SMT(LIA). Specifically, the purpose of this paper is to count the number of solutions (volume) of a SMT(LIA) formula, which has many important applications and is computationally hard. To solve the counting problem, an approximate method that employs a recent Markov Chain Monte Carlo (MCMC) sampling strategy called “flat histogram” is proposed. Furthermore, two refinement strategies are proposed for the sampling process and result in two algorithms, MCMC-Flat1/2 and MCMC-Flat1/t, respectively. In MCMC-Flat1/t, a pseudo sampling strategy is introduced to evaluate the flatness of histograms. Experimental results show that our MCMC-Flat1/t method can achieve good accuracy on both structured and random instances, and our MCMC-Flat1/2 is scalable for instances of convex bodies with up to 7 variables. View Full-Text
Keywords: Markov Chain Monte-Carlo; SAT modulo theories; volume computation; flat histogram Markov Chain Monte-Carlo; SAT modulo theories; volume computation; flat histogram
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Gao, W.; Lv, H.; Zhang, Q.; Cai, D. Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method. Algorithms 2018, 11, 142.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top