On decomposability and interaction functions

DOI10.3233/978-1-60750-606-5-9zbMATH Open1211.68440MaRDI QIDQ2999098FDOQ2999098

Authors: Knot Pipatsrisawat, Adnan Darwiche 

Publication date: 11 May 2011

Recommendations

• The complexity of AND-decomposition of Boolean functions
• Positive and Horn decomposability of partially defined Boolean functions
• Decomposition of Boolean functions applying the apparatus of Boolean derivatives
• Algorithmic issues of AND-decomposition of Boolean formulas
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram

Mathematics Subject Classification ID

Data structures (68P05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Boolean functions (06E30)

Cited In (6)

• Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
• On tractability of disjoint AND-decomposition of Boolean formulas
• On the Decomposability of $NC$ and $AC$
• Automatically finding the right probabilities in Bayesian networks
• Connecting knowledge compilation classes and width parameters
• The complexity of AND-decomposition of Boolean functions

This page was built for publication: On decomposability and interaction functions

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