Generic local computation

DOI10.1016/J.JCSS.2011.05.012zbMath1255.68156OpenAlexW2095255001MaRDI QIDQ414892

Cesar Schneuwly, Marc Pouly, Jürg Kohlas

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.012

zbMATH Keywords

local computationgeneric computationhypertree decompositionjoin treesvaluation algebras

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (6)

A mathematical theory of evidence turns 40 ⋮ Marginalization in models generated by compositional expressions ⋮ An algebraic theory for data linkage ⋮ On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras ⋮ Expressive efficiency of two kinds of specific CP-nets ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probability functions on complex pedigrees
• Hypertree decompositions and tractable queries
• Local computation with valuations from a commutative semigroup
• Conjunctive query containment revisited
• A comparison of structural CSP decomposition methods
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
• Bucket elimination: A unifying framework for reasoning
• The complexity of acyclic conjunctive queries
• Valuation-Based Systems for Bayesian Decision Analysis
• Probabilistic Networks and Expert Systems
• Propositional information systems
• Demi-groupes inversifs et demi-groupes réunions de demi-groupes simples
• On decompositions of a commutative semigroup

This page was built for publication: Generic local computation