Pages that link to "Item:Q2674206"

The following pages link to On the hardness of approximate reasoning (Q2674206):

Displaying 50 items.

• An enumerative algorithm for \#2SAT (Q283678) (← links)
• Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
• Disjunctive closures for knowledge compilation (Q460617) (← links)
• Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
• \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968) (← links)
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
• Complexity results for explanations in the structural-model approach (Q814579) (← links)
• Computing the fault tolerance of multi-agent deployment (Q835818) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• Propagation effects of model-calculated probability values in Bayesian networks (Q891771) (← links)
• Fast local search methods for solving limited memory influence diagrams (Q895537) (← links)
• An intercausal cancellation model for Bayesian-network engineering (Q899132) (← links)
• Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
• Understanding the scalability of Bayesian network inference using clique tree growth curves (Q991030) (← links)
• The number of independent sets in unicyclic graphs with a given diameter (Q1028107) (← links)
• Defaults and relevance in model-based reasoning (Q1127354) (← links)
• Permissive planning: Extending classical planning to uncertain task domains. (Q1399128) (← links)
• Semantics and complexity of abduction from default theories (Q1402749) (← links)
• Evaluation of Bayesian networks with flexible state-space abstraction methods (Q1603306) (← links)
• Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• Robustifying sum-product networks (Q1726242) (← links)
• Tree decompositions with small cost (Q1764801) (← links)
• Complexity results for structure-based causality. (Q1852862) (← links)
• Optimal control in dynamic food supply chains using big data (Q2026987) (← links)
• Approximate weighted model integration on DNF structures (Q2082501) (← links)
• Tractable inference in credal sentential decision diagrams (Q2206447) (← links)
• Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Some thoughts on knowledge-enhanced machine learning (Q2237522) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← links)
• Definability for model counting (Q2303508) (← links)
• On hard instances of non-commutative permanent (Q2306589) (← links)
• Expected computations on color spanning sets (Q2343982) (← links)
• On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
• An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
• Approximate algorithms for credal networks with binary variables (Q2379306) (← links)
• On probabilistic inference by weighted model counting (Q2389636) (← links)
• Expressive probabilistic description logics (Q2389639) (← links)
• Understanding the role of noise in stochastic local search: analysis and experiments (Q2389642) (← links)
• The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
• Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
• The number of independent sets in unicyclic graphs (Q2576351) (← links)
• Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)