Compiling propositional weighted bases

In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on the compilability issue for both problems, deriving mainly non-compilability results in the case preferences are subject to change. Then, we present a general notion of

• Type: Journal
• Year: 2004
• Where: AI
• Authors: Adnan Darwiche, Pierre Marquis
• Keywords: -normal Weighted Base, AI 2004, Artificial Intelligence, Propositional Weighted Bases, Weighted Base