Compiling propositional weighted bases
From MaRDI portal
Publication:814606
DOI10.1016/j.artint.2004.04.005zbMath1085.68166OpenAlexW2057299863MaRDI QIDQ814606
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
Related Items (6)
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Algebraic model counting ⋮ Hybrid possibilistic networks ⋮ Compiling relational Bayesian networks for exact inference ⋮ Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the maximum satisfiability problem
- A theory of diagnosis from first principles
- Tree clustering for constraint networks
- Nonmonotonic reasoning: From complexity to algorithms
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- On compact representations of propositional circumscription
- Is intractability of nonmonotonic reasoning a real drawback?
- Reducing belief revision to circumscription (and vice versa)
- Note about cardinality-based circumscription
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Preprocessing of intractable problems
- Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
- The size of a revised knowledge base
- Monotonic reductions, representative equivalence, and compilation of intractable problems
- Knowledge compilation and theory approximation
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Decomposable negation normal form
This page was built for publication: Compiling propositional weighted bases
