On probabilistic inference by weighted model counting

&
Artificial Intelligence 172 (6-7):772-799 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2007.11.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the complexity of inference about probabilistic relational models.Manfred Jaeger - 2000 - Artificial Intelligence 117 (2):297-308.
Panlingual lexical translation via probabilistic inference. Mausam, Stephen Soderland, Oren Etzioni, Daniel S. Weld, Kobi Reiter, Michael Skinner, Marcus Sammer & Jeff Bilmes - 2010 - Artificial Intelligence 174 (9-10):619-637.
Probabilistic inference in artificial intelligence: The method of Bayesian networks.Jean-Louis Golmard - 1955 - In Anthony Eagle (ed.), Philosophy of Probability. Routledge. pp. 257--291.
Probabilistic reasoning in intelligent systems: Networks of plausible inference.Stig Kjær Andersen - 1991 - Artificial Intelligence 48 (1):117-124.
Definability for model counting.Jean-Marie Lagniez, Emmanuel Lonca & Pierre Marquis - 2020 - Artificial Intelligence 281 (C):103229.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Advanced SMT techniques for weighted model integration.Paolo Morettin, Andrea Passerini & Roberto Sebastiani - 2019 - Artificial Intelligence 275 (C):1-27.
Approximate weighted model integration on DNF structures.Ralph Abboud, İsmail İlkan Ceylan & Radoslav Dimitrov - 2022 - Artificial Intelligence 311 (C):103753.
Enhancing SMT-based Weighted Model Integration by structure awareness.Giuseppe Spallitta, Gabriele Masina, Paolo Morettin, Andrea Passerini & Roberto Sebastiani - 2024 - Artificial Intelligence 328 (C):104067.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,336,069)

6 months
6 (#700,872)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Structured learning modulo theories.Stefano Teso, Roberto Sebastiani & Andrea Passerini - 2017 - Artificial Intelligence 244 (C):166-187.
Definability for model counting.Jean-Marie Lagniez, Emmanuel Lonca & Pierre Marquis - 2020 - Artificial Intelligence 281 (C):103229.

View all 16 citations / Add more citations

References found in this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Recursive conditioning.Adnan Darwiche - 2001 - Artificial Intelligence 126 (1-2):5-41.
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.

View all 6 references / Add more references