Definability for model counting

Artificial Intelligence 281 (C):103229 (2020)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

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

Through your library

Similar books and articles

On probabilistic inference by weighted model counting.Mark Chavira & Adnan Darwiche - 2008 - Artificial Intelligence 172 (6-7):772-799.
On propositional definability.Jérôme Lang & Pierre Marquis - 2008 - Artificial Intelligence 172 (8-9):991-1017.
Definability and commonsense reasoning.Gianni Amati, Luigia Carlucci Aiello & Fiora Pirri - 1997 - Artificial Intelligence 93 (1-2):169-199.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,415,873)

6 months
2 (#1,686,184)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
On probabilistic inference by weighted model counting.Mark Chavira & Adnan Darwiche - 2008 - Artificial Intelligence 172 (6-7):772-799.
On propositional definability.Jérôme Lang & Pierre Marquis - 2008 - Artificial Intelligence 172 (8-9):991-1017.

Add more references