{"product_id":"generic-inference-isbn-9780470527016","title":"Generic Inference","description":"This book provides a rigorous algebraic study of the most popular inference formalisms with a special focus on their wide application area, showing that all these tasks can be performed by a single generic inference algorithm. Written by the leading international authority on the topic, it includes an algebraic perspective (study of the valuation algebra framework), an algorithmic perspective (study of the generic inference schemes) and a \"practical\" perspective (formalisms and applications). Researchers in a number of fields including artificial intelligence, operational research, databases and other areas of computer science; graduate students; and professional programmers of inference methods will benefit from this work.  List of Instances and Applications.  \u003cp\u003eList of Figures and Tables.\u003c\/p\u003e \u003cp\u003eAcknowledgments.\u003c\/p\u003e \u003cp\u003eIntroduction.\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart I Local Computation.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Valuation Algebras.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Operations and Axioms.\u003c\/p\u003e \u003cp\u003e1.2 First Examples.\u003c\/p\u003e \u003cp\u003e1.3 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Inference Problems.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Graphs, Trees and Hypergraphs.\u003c\/p\u003e \u003cp\u003e2.2 Knowledgebases and their Representation.\u003c\/p\u003e \u003cp\u003e2.3 The Inference Probloem.\u003c\/p\u003e \u003cp\u003e2.4 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Computing Single Queries.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Valuation Algebras with Variable Elimination.\u003c\/p\u003e \u003cp\u003e3.2 Fusion and Bucker Elimination.\u003c\/p\u003e \u003cp\u003e3.3 Valuation Algebras with Neutral Elements.\u003c\/p\u003e \u003cp\u003e3.4 Valuation Algebras with Null Elements.\u003c\/p\u003e \u003cp\u003e3.5 Local Computation as Message Passing Scheme.\u003c\/p\u003e \u003cp\u003e3.6 Covering Join Trees.\u003c\/p\u003e \u003cp\u003e3.7 Join Tree Construction.\u003c\/p\u003e \u003cp\u003e3.8 The Collect Algorithm.\u003c\/p\u003e \u003cp\u003e3.9 Adjoining an Identity Element.\u003c\/p\u003e \u003cp\u003e3.10 The Generalized Collect Algorithm.\u003c\/p\u003e \u003cp\u003e3.11 An Application: The Fast Fourier Transform.\u003c\/p\u003e \u003cp\u003e3.12 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Computing Multiple Queries.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 The Shenoy Shafer.\u003c\/p\u003e \u003cp\u003e4.2 Valuation Algebras with Inverse Elements.\u003c\/p\u003e \u003cp\u003e4.3 The Lauritzen Spiegelhalter Architecture.\u003c\/p\u003e \u003cp\u003e4.4 The HUGIN Architecture.\u003c\/p\u003e \u003cp\u003e4.5 The Idempotent Architecture.\u003c\/p\u003e \u003cp\u003e4.6 Answering Uncovered Queries.\u003c\/p\u003e \u003cp\u003e4.7 Scaling and Normalization.\u003c\/p\u003e \u003cp\u003e4.8 Local Computation with Scaling.\u003c\/p\u003e \u003cp\u003e4.9 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart II Generic Constructions.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Semiring Valuation Algebras.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Semirings.\u003c\/p\u003e \u003cp\u003e5.2 Semirings and Order.\u003c\/p\u003e \u003cp\u003e5.3 Semiring Valuation Algebras.\u003c\/p\u003e \u003cp\u003e5.4 Examples of Semiring Valuation Algebras.\u003c\/p\u003e \u003cp\u003e5.5 Properties of Semiring Valuation Algebras.\u003c\/p\u003e \u003cp\u003e5.6 Some Computational Aspects.\u003c\/p\u003e \u003cp\u003e5.7 Set Based Semiring Valuation Algebras.\u003c\/p\u003e \u003cp\u003e5.8 Properties of Set Based Semiring Valuation Algebras.\u003c\/p\u003e \u003cp\u003e5.9 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Valuation Algebras for Path Problems.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Some Path Problem Examples.\u003c\/p\u003e \u003cp\u003e6.2 The Algebraic Path Problem.\u003c\/p\u003e \u003cp\u003e6.3 Quasi Regular Semirings.\u003c\/p\u003e \u003cp\u003e6.4 Quasi Regular Valuation Algebras.\u003c\/p\u003e \u003cp\u003e6.5 Properties of Quasi Regular Valuation Algebras.\u003c\/p\u003e \u003cp\u003e6.6 Kleene Algebras.\u003c\/p\u003e \u003cp\u003e6.7 Kleene Valuation Algebras.\u003c\/p\u003e \u003cp\u003e6.8 Properties of Kleene Valuation Algebras.\u003c\/p\u003e \u003cp\u003e6.9 Further Path Problems.\u003c\/p\u003e \u003cp\u003e6.10 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Language and Information.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Propositional Logic.\u003c\/p\u003e \u003cp\u003e7.2 Linear Equations.\u003c\/p\u003e \u003cp\u003e7.3 Information in Context.\u003c\/p\u003e \u003cp\u003e7.4 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePart III Applications.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Dynamic Programming.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Solutions and Solution Extensions.\u003c\/p\u003e \u003cp\u003e8.2 Computing Solutions.\u003c\/p\u003e \u003cp\u003e8.3 Optimization and Constraint Problems.\u003c\/p\u003e \u003cp\u003e8.4 Computing Solutions of Optimization Problems.\u003c\/p\u003e \u003cp\u003e8.5 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Sparse Matrix Techniques.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Systems of Linear Equations.\u003c\/p\u003e \u003cp\u003e9.2 Symmetric, Positive Definite Matrices.\u003c\/p\u003e \u003cp\u003e9.3 Semiring Fixpoint Equation Systems.\u003c\/p\u003e \u003cp\u003e9.4 Conclusion.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Gaussian Information.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Gaussian Systems and Potentials.\u003c\/p\u003e \u003cp\u003e10.2 Generalized Gaussian Potentials.\u003c\/p\u003e \u003cp\u003e10.3 Gaussian Information and Gaussian Potentials.\u003c\/p\u003e \u003cp\u003e10.4 Valuation Algebra of Gaussian Potentials.\u003c\/p\u003e \u003cp\u003e10.5 An Application: Gaussian Dynamic Systems.\u003c\/p\u003e \u003cp\u003e10.6 An Application: Gaussian Bayesian Networks.\u003c\/p\u003e \u003cp\u003e10.7 Conclusion.\u003c\/p\u003e \u003cp\u003eAppendix.\u003c\/p\u003e \u003cp\u003eReferences. \u003c\/p\u003e \u003cp\u003eIndex.\u003c\/p\u003e  \u003cb\u003eMarc Pouly, PhD\u003c\/b\u003e, received the Award for Outstanding PhD Thesis in Computer Science at the University of Fribourg (Switzerland), in 2008. He was visiting researcher at the Cork Constraint Computation Centre in Ireland and, since 2010, he is researcher at the Interdisciplinary Centre for Security, Reliability and Trust of the University of Luxembourg.  \u003cp\u003e\u003cb\u003eJürg Kohlas, PhD\u003c\/b\u003e, is Professor of Theoretical Computer Science in the Department of Informatics at the University of Fribourg (Switzerland). His research interests include algebraic theory of information and probabilistic argumentation.\u003c\/p\u003e  \u003cb\u003eA Rigorous Algebraic Study of the Most Popular Inference Formalisms\u003c\/b\u003e  \u003cp\u003eThis unique text provides a complete algebraic and algorithmic study of generic inference methods that are derived from the general valuation algebra framework, with special focus on the many practical applications in computer science. Written by the leading international authorities on the topic, \u003ci\u003eGeneric Inference\u003c\/i\u003e is divided into three parts:\u003c\/p\u003e \u003cul\u003e \u003cli\u003e \u003cp\u003ePart I defines the valuation algebra framework and gives a first catalog of practically important examples; explains the generic inference problem and surveys fundamental applications that require the solution of such problems with knowledge bases from different valuation algebras; develops generic algorithms for the solution of single- and multiple-query inference problems with arbitrary valuation algebras; and discusses issues related to complexity and optimization\u003c\/p\u003e \u003c\/li\u003e \u003cli\u003e \u003cp\u003ePart II identifies several important families of valuation algebras derived from other mathematical structures—including soft constraints, path problems, linear systems, and logical structures—and uncovers the close relationship between valuation algebras and semiring theory\u003c\/p\u003e \u003c\/li\u003e \u003cli\u003e \u003cp\u003ePart III discusses various applications of generic inference, with chapters dedicated to dynamic optimization, sparse matrix techniques, and linear systems with stochastic disturbances\u003c\/p\u003e \u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eThe text is accompanied by a large number of examples; at the end of every chapter are selected exercises and open research problems. A comprehensive bibliography on valuation algebras and local computation is provided, and all algorithms are developed mathematically and given in pseudo-code. \u003ci\u003eGeneric Inference\u003c\/i\u003e is designed for researchers in a number of fields, including artificial intelligence, operational research, databases, and other areas of computer science; graduate students and other researchers interested in general reasoning frameworks; and professional programmers of inference methods.\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":47989277786341,"sku":"NP9780470527016","price":142.95,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9780470527016.jpg?v=1761783488","url":"https:\/\/k12savings.com\/products\/generic-inference-isbn-9780470527016","provider":"K12savings","version":"1.0","type":"link"}