Approximate counting in SMT and value estimation for probabilistic programs
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 5880
- Type
- D - Journal article
- DOI
-
10.1007/s00236-017-0297-2
- Title of journal
- ACTA Informatica
- Article number
- -
- First page
- 729
- Volume
- 54
- Issue
- 8
- ISSN
- 0001-5903
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This article is an invited extension of research that was nominated for a best paper award at the confederation of top European conferences on theory and practice of software, ETAPS'15. It proposes a new measure-based definition of model counting for logical theories and brings insights from the computational complexity theory to the growing body of literature on probabilistic programming. The work has been cited in programming languages, verification, and artificial intelligence communities. It led to an ESSLLI'16 summer school course, distinguished by a sponsorship from the European Association for Computer Science Logic (awarded to 1 out of 48 ESSLLI'16 courses).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -