#### Filter Results:

- Full text PDF available (181)

#### Publication Year

1988

2017

- This year (5)
- Last 5 years (52)
- Last 10 years (111)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Adnan Darwiche, Judea Pearl
- TARK
- 1994

We show in this paper that the AGM postulates are too week to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning.… (More)

- Adnan Darwiche
- UAI
- 2000

We present a new approach to inference in Bayesian networks, which is based on representing the network using a polynomial and then retrieving answers to probabilistic queries by evaluating and differentiating the polynomial. The network polynomial itself is exponential in size, but we show how it can be computed efficiently using an arithmetic circuit that… (More)

- Adnan Darwiche, Pierre Marquis
- J. Artif. Intell. Res.
- 2002

We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We then provide a knowledge compilation map, which analyzes a large number of… (More)

- Adnan Darwiche
- Artif. Intell.
- 2001

Darwiche: Optimal time space tradeoff in probabilistic inference. IJCAI' 03.

- Adnan Darwiche
- J. ACM
- 2001

Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability of general propositional reasoning. According to this approach, the reasoning process is split into two phases: an off-line compilation phase and an on-line query-answering phase. In the off-line phase, the propositional theory… (More)

- Adnan Darwiche, James D. Park
- J. Artif. Intell. Res.
- 2004

MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation (Pr), or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in… (More)

- Adnan Darwiche
- J. Artif. Intell. Res.
- 1998

This paper presents a comprehensive approach for model-based diagnosis which includes proposals for characterizing and computing preferred diagnoses, assuming that the system description is augmented with a system structure (a directed graph explicating the interconnections between system components). Speciically, we rst introduce the notion of a… (More)

- Adnan Darwiche
- IJCAI
- 2011

We identify a new representation of proposi-tional knowledge bases, the Sentential Decision Diagram (SDD), which is interesting for a number of reasons. First, it is canonical in the presence of additional properties that resemble reduction rules of OBDDs. Second, SDDs can be combined using any Boolean operator in polytime. Third, CNFs with n variables and… (More)

- Mark Chavira, Adnan Darwiche
- Artif. Intell.
- 2008

A recent and effective approach to probabilistic inference calls for reducing the problem to one of weighted model counting (WMC) on a propositional knowledge base. Specifically, the approach calls for encoding the probabilistic model, typically a Bayesian network, as a propositional knowledge base in conjunctive normal form (CNF) with weights associated to… (More)

- Adnan Darwiche
- ECAI
- 2004