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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Acta informatica Ročník 54; číslo 8; s. 729 - 764
Hlavní autori:	Chistikov, Dmitry, Dimitrova, Rayna, Majumdar, Rupak
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!