Compiling propositional weighted bases

DOI10.1016/J.ARTINT.2004.04.005MaRDI QIDQ814606zbMATH OpenOpenAlexFDO

Authors Adnan Darwiche, Pierre Marquis

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2004.04.005

zbMATH Keywords

Knowledge representationBelief basesKnowledge compilationPenalty logic

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Decomposable negation normal form
• On stratified belief base compilation
• Weighted positive binary decision diagrams for exact probabilistic inference
• On probabilistic inference by weighted model counting
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 67512 (Why is no real title available?)
• scientific article; zbMATH DE number 1269566 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 1509480 (Why is no real title available?)
• A theory of diagnosis from first principles
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Algorithms for the maximum satisfiability problem
• Computation in valuation algebras
• Decomposable negation normal form
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Is intractability of nonmonotonic reasoning a real drawback?
• Knowledge compilation and theory approximation
• Monotonic reductions, representative equivalence, and compilation of intractable problems
• Nonmonotonic reasoning: From complexity to algorithms
• Note about cardinality-based circumscription
• On compact representations of propositional circumscription
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Preprocessing of intractable problems
• Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
• Reducing belief revision to circumscription (and vice versa)
• The size of a revised knowledge base
• Tree clustering for constraint networks

Cited in

(8)

• Compiling relational Bayesian networks for exact inference
• On stratified belief base compilation
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
• Hybrid possibilistic networks
• Valued constraint satisfaction problems
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Algebraic model counting
• Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations

This page was built for publication: Compiling propositional weighted bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814606)