On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
From MaRDI portal
Publication:4443390
DOI10.3166/JANCL.11.11-34zbMath1033.03505OpenAlexW2010438070MaRDI QIDQ4443390
Publication date: 11 January 2004
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.11.11-34
Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42)
Related Items (26)
An enumerative algorithm for \#2SAT ⋮ On Compiling CNFs into Structured Deterministic DNNFs ⋮ Unnamed Item ⋮ On probabilistic inference by weighted model counting ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Knowledge compilation meets database theory: compiling queries to decision diagrams ⋮ Algebraic model counting ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ Connecting Width and Structure in Knowledge Compilation (Extended Version) ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ On computing probabilistic abductive explanations ⋮ Boolean functional synthesis: from under the hood of solvers ⋮ A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy ⋮ From statistical relational to neurosymbolic artificial intelligence: a survey ⋮ On the role of logical separability in knowledge compilation ⋮ An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL ⋮ On the relation between structured \(d\)-DNNFs and SDDs ⋮ Local Diagnosis ⋮ Connecting knowledge compilation classes and width parameters ⋮ Propagation complete encodings of smooth DNNF theories ⋮ The Computational Complexity of Understanding Binary Classifier Decisions ⋮ Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases ⋮ Compiling propositional weighted bases ⋮ Weighted model counting without parameter variables
Cites Work
- Graph driven BDDs -- a new data structure for Boolean functions
- A logical notion of conditional independence: properties and applications
- Characterizing diagnoses and systems
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
- Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's
- Logic Programming and Nonmonotonic Reasoning
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Constant-space reasoning in dynamic Bayesian networks
This page was built for publication: On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
