"The complexity of Bayesian networks specified by propositional and ..."

Fábio Gagliardi Cozman, Denis Deratani Mauá (2018)

> Home

SPARQL queries

Details and statistics

DOI: 10.1016/J.ARTINT.2018.06.001

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ai/CozmanM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/CozmanM18
Fábio Gagliardi Cozman, Denis Deratani Mauá:
The complexity of Bayesian networks specified by propositional and relational languages. Artif. Intell. 262: 96-141 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.