Generic Inference: A Unifying Theory for Automated Reasoning / Edition 1

Hardcover (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $92.05
Usually ships in 1-2 business days
(Save 25%)
Other sellers (Hardcover)
  • All (8) from $92.05   
  • New (6) from $92.05   
  • Used (2) from $92.27   


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.

Read More Show Less

Product Details

  • ISBN-13: 9780470527016
  • Publisher: Wiley
  • Publication date: 5/24/2011
  • Edition number: 1
  • Pages: 484
  • Product dimensions: 6.30 (w) x 9.30 (h) x 1.20 (d)

Meet the Author

Marc Pouly, PhD, 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.

Jürg Kohlas, PhD, 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.

Read More Show Less

Table of Contents

List of Instances and Applications.

List of Figures and Tables.



Part I Local Computation.

1 Valuation Algebras.

1.1 Operations and Axioms.

1.2 First Examples.

1.3 Conclusion.

2 Inference Problems.

2.1 Graphs, Trees and Hypergraphs.

2.2 Knowledgebases and their Representation.

2.3 The Inference Probloem.

2.4 Conclusion.

3 Computing Single Queries.

3.1 Valuation Algebras with Variable Elimination.

3.2 Fusion and Bucker Elimination.

3.3 Valuation Algebras with Neutral Elements.

3.4 Valuation Algebras with Null Elements.

3.5 Local Computation as Message Passing Scheme.

3.6 Covering Join Trees.

3.7 Join Tree Construction.

3.8 The Collect Algorithm.

3.9 Adjoining an Identity Element.

3.10 The Generalized Collect Algorithm.

3.11 An Application: The Fast Fourier Transform.

3.12 Conclusion.

4 Computing Multiple Queries.

4.1 The Shenoy Shafer.

4.2 Valuation Algebras with Inverse Elements.

4.3 The Lauritzen Spiegelhalter Architecture.

4.4 The HUGIN Architecture.

4.5 The Idempotent Architecture.

4.6 Answering Uncovered Queries.

4.7 Scaling and Normalization.

4.8 Local Computation with Scaling.

4.9 Conclusion.

Part II Generic Constructions.

5 Semiring Valuation Algebras.

5.1 Semirings.

5.2 Semirings and Order.

5.3 Semiring Valuation Algebras.

5.4 Examples of Semiring Valuation Algebras.

5.5 Properties of Semiring Valuation Algebras.

5.6 Some Computational Aspects.

5.7 Set Based Semiring Valuation Algebras.

5.8 Properties of Set Based Semiring Valuation Algebras.

5.9 Conclusion.

6 Valuation Algebras for Path Problems.

6.1 Some Path Problem Examples.

6.2 The Algebraic Path Problem.

6.3 Quasi Regular Semirings.

6.4 Quasi Regular Valuation Algebras.

6.5 Properties of Quasi Regular Valuation Algebras.

6.6 Kleene Algebras.

6.7 Kleene Valuation Algebras.

6.8 Properties of Kleene Valuation Algebras.

6.9 Further Path Problems.

6.10 Conclusion.

7 Language and Information.

7.1 Propositional Logic.

7.2 Linear Equations.

7.3 Information in Context.

7.4 Conclusion.

Part III Applications.

8 Dynamic Programming.

8.1 Solutions and Solution Extensions.

8.2 Computing Solutions.

8.3 Optimization and Constraint Problems.

8.4 Computing Solutions of Optimization Problems.

8.5 Conclusion.

9 Sparse Matrix Techniques.

9.1 Systems of Linear Equations.

9.2 Symmetric, Positive Definite Matrices.

9.3 Semiring Fixpoint Equation Systems.

9.4 Conclusion.

10 Gaussian Information.

10.1 Gaussian Systems and Potentials.

10.2 Generalized Gaussian Potentials.

10.3 Gaussian Information and Gaussian Potentials.

10.4 Valuation Algebra of Gaussian Potentials.

10.5 An Application: Gaussian Dynamic Systems.

10.6 An Application: Gaussian Bayesian Networks.

10.7 Conclusion.




Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)