Approximate counting in SMT and value estimation for probabilistic programs

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of satisfiability modulo theories (SMT) there is a growing need for model...

Full description

Saved in:

Bibliographic Details
Published in:	Acta informatica Vol. 54; no. 8; pp. 729 - 764
Main Authors:	Chistikov, Dmitry, Dimitrova, Rayna, Majumdar, Rupak
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017 Springer Nature B.V
Subjects:	Algorithms Arithmetic Boolean algebra Computer programming Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Information flow Information Systems and Communication Service Integer programming Logics and Meanings of Programs Original Article Polynomials Software Engineering/Programming and Operating Systems Solvers Static code analysis Theory of Computation
ISSN:	0001-5903, 1432-0525
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!