Generic inference. A unifying theory for automated reasoning

DOI10.1002/9781118010877MaRDI QIDQ3067862zbMATH OpenOpenAlexFDO

Authors Marc Pouly, Jürg Kohlas

Publication date 13 January 2011

Full work available at URL https://doi.org/10.1002/9781118010877

zbMATH Keywords

inferenceautomated reasoning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semirings (16Y60) Algorithms in computer science (68W99) Artificial intelligence (68Txx) Valuations and their generalizations for commutative rings (13A18)

Recommendations

• scientific article; zbMATH DE number 1945067
• scientific article; zbMATH DE number 886137
• Probabilistic Logic Networks
• Reasoning with probabilistic and deterministic graphical models. Exact algorithms
• Ordered valuation algebras: A generic framework for approximating inference

Cited in

(9)

• An algebraic theory for data linkage
• Sufficient and necessary conditions for solution finding in valuation-based systems
• Causal compositional models in valuation-based systems with examples in specific theories
• Generalized information theory based on the theory of hints
• Contextuality in distributed systems
• Probabilistic reasoning with graphical security models
• Compositional models in valuation-based systems
• Non-locality, contextuality and valuation algebras: a general theory of disagreement
• DAG-based attack and defense modeling: don't miss the forest for the attack trees

This page was built for publication: Generic inference. A unifying theory for automated reasoning

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