References

Aho, A., Hopcroft, J.E., & Ullman, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company.

Aji, S.M. 1999. Graphical Models and Iterative Decoding. Ph.D. thesis, California Institute of Technology.

Aji, S.M., & McEliece, R.J. 2000. The Generalized Distributive Law. IEEE Trans. On Information Theory, 46(2), 325–343.

Allen, D., & Darwiche, A. 2002. On the Optimality of the min-fill Heuristic. Tech. rept. University of California, Los Angeles.

Allen, D., & Darwiche, A. 2003. Optimal Time-Space Tradeoff in Probabilistic Inference. Pages 969–975 of: IJCAI’03: Proc. of the 18th Int. Joint Conference on Artif. Intell. Morgan Kaufmann Publishers, Inc.

Almond, R., & Kong, A. 1991. Optimality Issues in Constructing a Markov Tree from Graphical Models. Research Report A-3. Department of Statistics, Harvard University.

Apt, K.R. 2003. Principles of Constraint Programming. Cambridge University Press.

Arnborg, S. 1985. Efficient Algorithms for Combinatorial Problems with Bounded Decomposability – A Survey. BIT, 25(1), 2–23.

Arnborg, S., Corneil, D., & Proskurowski, A. 1987. Complexity of Finding Embeddings in a k-Tree. SIAM J. of Algebraic and Discrete Methods, 8, 277–284.

Bacchus, F., & Adam, G. 1995. Graphical Models for Preference and Utility. Pages 3–10 of: UAI’95: Proc. of the 11th Conference on Uncertainty in Artif. Intell. Morgan Kaufmann Publishers, Inc.

Bacchus, F., Dalmao, S., & Pitassi, T. 2003. Value Elimination: Bayesian Interence via Backtracking Search. Pages 20–28 of: UAI’03: Proc. of the 19th Conference on Uncertainty in Artif. Intell.

Backhouse, R.C., & Carré, B.A. 1975. Regular Algebra Applied to Path-Finding Problems. J. of the Institute for Mathematics and its Applications, 15, 161–186.

Barwise, J., & Seligman, J. 1997. The Logic of Distributed Systems. Cambridge University Press.

Beauchamp, K.G. 1984. Applications of Walsh and related Functions. Academic Press, Inc.

Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. 1983. On the Desirability of Acyclic Database Schemes. J. of the ACM, 30(3), 479–513.

Bellman, R. 1958. On a Routing Problem. Quarterly of Applied Mathematics, 16(1), 87–90.

Bellman, R.E. 1957. Dynamic Programming. Princeton University Press.

Bertele, U., & Brioschi, F. 1972. Nonserial Dynamic Programming. Academic Press, Inc.

Bétréma, J. 1982. Topologies sur des Espaces Ordonnés. Informatique Théorique et Applications, 16(2), 165–182.

Biacino, L. 2007. Fuzzy Subsethood and Belief Functions of Fuzzy Events. Fuzzy Sets and Systems, 158(1), 38–49.

Bistarelli, S., & Rossi, F. 2008. Semiring-Based Soft Constraints. Pages 155–173 of: Degano, P., Nicola, R. De, & Meseguer, J. (eds), Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday. Springer-Verlag.

Bistarelli, S., Montanari, U., & Rossi, F. 1997. Semiring-Based Constraint Satisfaction and Optimization. J. of the ACM, 44(2), 201–236.

Bistarelli, S., Montanari, U., Rossi, F., Verfaillie, G., & Fargier, H. 1999. Semiring-based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4(3).

Bistarelli, S., Frühwirth, T., Marte, M., & Rossi, F. 2002. Soft Constraint Propagation and Solving in Constraint Handling Rules. Pages 1–5 of: Proc. of the ACM Symposium on Applied Computing.

Blau, H., Kyburg, J.R., & Henry, E. 1994. Ploxoma: Testbed for Uncertain Inference. Tech. rept. University of Rochester.

Bodlaender, H. 1993. A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth. Pages 226–234 of: STOC’93: Proc. of the 25th Annual ACM Symposium on Theory of Computing. ACM Press.

Bodlaender, H. 1998. Treewidth: Algorithmic Techniques and Results. Pages 19–36 of: Mathematical Foundations of Computer Science. Springer-Verlag.

Broder, A.Z., & Mayr, E.W. 1997. Counting Minimum Weight Spanning Trees. J. of Algorithms, 24(1), 171–176.

Cano, A., & Moral, S. 1995. Heuristic Algorithms for the Triangulation of Graphs. Pages 166–171 of: Bouchon-Meunier, R.R. Yager, & Zadeh, L.A. (eds), Proc. of the 5th IPMU Conference. Springer-Verlag.

Chang, C.L., & Lee, R.C.T. 1973. Symbolic Logic and Mechanical Theorem Proving. Academic Press, Inc.

Chaudhuri, S., & Zaroliagis, C.D. 1997. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, 27, 212–226.

Chvátal, V. 1983. Linear Programming. W.H. Freeman.

Clifford, A.H., & Preston, G.B. 1967. Algebraic Theory of Semigroups. American Mathematical Society.

Conway, J.H. 1971. Regular Algebra and Finite Machines. Chapman and Hall Mathematics Series. Chapman and Hall.

Cooley, J.W., & Tukey, J.W. 1965. An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation, 19(90), 297–301.

Cowell, R.G., Dawid, A.P., Lauritzen, S.L., & Spiegelhalter, D.J. 1999. Probabilistic Networks and Expert Systems. Information Sci. and Stats. Springer-Verlag.

Croisot, R. 1953. Demi-Groupes Inversifs et Demi-Groupes Réunions de Demi-Groupes Simples. Ann. Sci. Ecole norm. Sup., 79(3), 361–379.

Darwiche, A. 2001. Decomposable Negation Normal Form. J. of the ACM, 48(4), 608–647.

Darwiche, A., & Marquis, P. 2001. A Perspective on Knowledge Compilation. Pages 175–182 of: IJCAI’01: Proc. of the 17th Int. Joint Conference on Artif Intell. San Francisco, CA, USA: Morgan Kaufmann Publishers, Inc.

Darwiche, A., & Marquis, P. 2002. A Knowledge Compilation Map. J. of Artif. Intell. Research, 17, 229–264.

Davey, B.A., & Priestley, H.A. 1990. Introduction to Lattices and Order. Cambridge University Press.

de Kleer, J., Brown, J., & Seely, J. 1986. Theories of Causal Ordering. Artif. Intell., 29(1), 33–61.

Dechter, R. 1999. Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell., 113, 41–85.

Dechter, R. 2003. Constraint Processing. Morgan Kaufmann Publishers, Inc.

Dechter, R. 2006. Tractable Structures for Constraint Satisfaction Problems. In: Rossi, F., van Beek, P., & Walsh, T. (eds), Handbook of Constraint Programming. Elsevier.

Dechter, R., & Mateescu, R. 2007. AND/OR Search Spaces for Graphical Models. Artif. Intell., 171(2–3), 73–106.

Dechter, R., & Pearl, J. 1987. Network-Based Heuristics for Constraint-Satisfaction Problems. Artif. Intell., 34(1), 1–38.

Dechter, R., & Pearl, J. 1989. Tree Clustering for Constraint Networks. Artif. Intell., 38(3), 353–366.

Dechter, R., & Rish, R. 2003. Mini-Buckets: A General Scheme for Bounded Inference. J. of the ACM, 50(2), 107–153.

Dempster, A.P. 1968. A Generalization of Bayesian Inference. J. Royal Stat. Soc. B, 30, 205–247.

Dempster, A.P. 1990a. Construction and Local Computation Aspects of Network Belief Functions. In: Smith, J.Q., & Oliver, R.M. (eds), Influence Diagrams, Belief Nets and Decision Analysis. John Wiley & Sons, Inc.

Dempster, A.P. 1990b. Normal Belief Functions and the Kalman Filter. Tech. rept. Harvard University, USA.

Dijkstra, E.W. 1959. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269–271.

Downey, R., & Fellows, M. 1999. Parameterized Complexity. Springer-Verlag.

Eichenberger, Ch. 2009. Algebras of Gaussian Linear Information. Ph.D. thesis, Dept. of Computer Science, University of Fribourg.

Fargier, H., & Marquis, P. 2007. On Valued Negation Normal Form Formulas. Pages 360–365 of: IJCAI’07: Proc. of the 20th Int. Joint Conference on Artif. Intell.

Fargier, H., & Vilarem, M. 2004. Compiling CSPs into Tree-Driven Automata for Interactive Solving. Constraints, 9(4), 263–287.

Fishburn, P.C. 1974. Lexicographic Orders, Utilities and Decision Rules: A Survey. Management Science, 20, 1442–1471.

Fisher, R.A. 1935. The Fiducial Argument in Statistical Inference. Ann. Eugen., 9, 391–398.

Fisher, R.A. 1950. Contributions to Mathematical Statistics. John Wiley & Sons, Inc.

Floyd, R.W. 1962. Algorithm 97: Shortest Path. Comm. ACM, 5, 345.

Ford, L.R. 1956. Network Flow Theory. Tech. rept. The RAND Corperation, Santa Moncia, California.

Forsythe, G., & Moler, C.B. 1967. Computer Solution of Linear Algebra Systems. Prentice Hall.

Gallager, R.C. 1963. Low Density Parity Check Codes. MIT Press.

Garey, M.R., & Johnson, D.S. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman.

Golan, J. S. 1999. Semirings and their Applications. Kluwer, Dordrecht.

Golan, J.S. 2003. Semirings and Affine Equations over them: Theory and Applications. Kluwer, Dordrecht.

Gondran, M., & Minoux, M. 2008. Graphs, Dioids and Semirings: New Models and Algorithms. Operations Research Computer Science Interfaces Series. Springer-Verlag.

Gonzalez, R.C., & Woods, R.E. 2006. Digital Image Processing. 3 edn. Prentice Hall.

Gordon, J., & Shortliffe, E.H. 1985. A Method for Managing Evidential Reasoning in a Hierarchical Hypothesis Space. Artif. Intell., 26(3), 323–357.

Grabisch, M. 2009. Belief Functions on Lattices. Int. J. Intell. Syst., 24(1), 76–95.

Grätzer, G. 1978. General Lattice Theory. Pure and Applied Mathematics, vol. 75. Academic Press, Inc.

Green, J.A. 1951. On the Structure of Semigroups. Ann. of Math., 54, 163–172.

Haenni, R. 2004. Ordered Valuation Algebras: A Generic Framework for Approximating Inference. Int. J. Approx. Reasoning, 37(1), 1–41.

Haenni, R., & Lehmann, N. 1999. Efficient Hypertree Construction. Tech. rept. 99–3. Department of Informatics, University of Fribourg.

Haenni, R., Kohlas, J., & Lehmann, N. 2000. Probabilistic Argumentation Systems. Pages 221–287 of: Kohlas, J., & Moral, S. (eds), Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning. Kluwer, Dordrecht.

Harville, D.A. 1997. Matrix Algebra from a Statistician’s Perspective. Springer-Verlag.

Hewitt, E., & Zuckerman, H.S. 1956. The l1-Algebra of a Commutative Semigroup. Amer. Math. Soc., 83, 70–97.

Hopkins, M., & Darwiche, A. 2002. A Practical Relaxation of Constant-Factor Treewidth Approximation Algorithms. In: Proc. of the 1st European Workshop on Probabilistic Graphical Models.

Inoue, K. 1992. Linear Resolution for Consequence Finding. Artif Intell., 56(2–3), 301–353.

Jensen, F.V. 1988. Junction Trees and Decomposable Hypergraphs. Tech. rept. Aalborg University, Denmark.

Jensen, F.V., Lauritzen, S.L., & Olesen, K.G. 1990. Bayesian Updating in Causal Probabilistic Networks by Local Computation. Computational Statistics Quarterly, 4, 269–282.

Jonczy, J. 2009. Generic Frameworks for the Analysis of Dependable Systems: Algebraic Path Problems, Reliability, and Diagnostics. Ph.D. thesis, University of Berne, Switzerland.

Kalman, R.E. 1960. A new Approach to Linear Filtering and Predictive Problems. Trans. of the ASME – J. of Basic Engineering, 82, 34–45.

Kanal, L., & Kumar, V. (eds). 1988. Search in Artificial Intelligence. Springer-Verlag.

Kask, K., Dechter, R., Larrosa, J., & Fabio, G. 2001. Bucket-Tree Elimination for Automated Reasoning. Artif. Intell., 125, 91–131.

Kemeny. J.G., Mirkil, H., Snell, J.L., & Thompson, G.L. 1960. Finite Mathematical Structures. Prentice Hall.

Kleene, S. 1956. Representation of Events in Nerve Nets and Finite Automata. Princeton University Press.

Kohlas, J. 1991. Describing Uncertainty in Dynamical Systems by Uncertain Restrictions. Pages 210–223 of: Masi, G.B. Di, Gombani, A., & Kurzhansky, A.B. (eds), Modeling, Estimation and Control of Systems with Uncertainty. Birkhäuser, Boston.

Kohlas, J. 2003. Information Algebras: Generic Structures for Inference. Springer-Verlag.

Kohlas, J. 2004. Valuation Algebras Induced by Semirings. Tech. rept. 04-03. Department of Informatics, University of Fribourg.

Kohlas, J., & Monney, P.-A. 1995. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence. Lecture Notes in Economics and Mathematical Systems, vol. 425. Springer-Verlag.

Kohlas, J., & Monney, P.-A. 2008. Statistical Information. Assumption-Based Statistical Inference. Sigma Series in Stochastics, vol. 3. Heldermann.

Kohlas, J., & Wilson, N. 2006. Exact and Approximate Local Computation in Semiring Induced Valuation Algebras. Tech. rept. 06-06. Department of Informatics, University of Fribourg.

Kohlas, J., & Wilson, N. 2008. Semiring induced Valuation Algebras: Exact and Approximate Local Computation Algorithms. Artif. Intell., 172(11), 1360–1399.

Kohlas, J., Haenni, R., & Moral, S. 1999. Propositional Information Systems. J. of Logic and Computation, 9(5), 651–681.

Kong, A. 1986. Multivariate Belief Functions and Graphical Models. Ph.D. thesis, Department of Statistics, Harvard University.

Kozen, D. 1990. On Kleene Algebras and Closed Semirings. Pages 26–47 of: Lecture Notes in Computer Science. Springer-Verlag.

Kozen, D. 1994. A Completeness Theorem for Kleene Algebras and the Algebra of regular Events. Information and Computing, 110(2), 366–390.

Kozlov, A.V., & Singh, J.P. 1994. A Parallel Lauritzen-Spiegelhalter Algorithm for Probabilistic Inference. Pages 320–329 of: Supercomputing ‘94: Proc. of the 1994 ACM/IEEE Conference on Supercomputing. ACM Press.

Kozlov, A.V., & Singh, J.P. 1996. Parallel Implementations of Probabilistic Inference. Computer, 29(12), 33–40.

Kschischang, F.R., Frey, B.J., & Loeliger, H.A. 2001. Factor Graphs and the Sum-Product Algorithm. IEEE Trans. on Information Theory, 47(2), 498–519.

Langel, J. 2010. Logic and Information: A Unifying Approach to Semantic Information Theory. Ph.D. thesis, Department of Informatics, University of Fribourg.

Larrosa, J., & Dechter, R. 2003. Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints, 8(3), 303–326.

Larrosa, J., & Morancho, E. 2003. Solving ‘Still Life’ with Soft Constraints and Bucket Elimination. Pages 466–479 of: CP’03: Proc. of the 9th Int. Conference on Principles and Practice of Constraint Programming.

Lauritzen, S.L., & Jensen, F.V. 1997. Local Computation with Valuations from a Commutative Semigroup. Ann. Math. Artif Intell, 21(1), 51–69.

Lauritzen, S.L., & Spiegelhalter, D.J. 1988. Local Computations with Probabilities on Graphical Structures and their Application to Expert Systems. J. Royal Stat. Soc. B, 50, 157–224.

Lehmann, D.J. 1976. Algebraic Structures for Transitive Closure. Tech. rept. Department of Computer Science, University of Warwick.

Lehmann, N. 2001. Argumentation System and Belief Functions. Ph.D. thesis, Department of Informatics, University of Fribourg.

Lepar, V, & Shenoy, P.P. 1998. A Comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions. Pages 328–337 of: Cooper, G., & Moral, S. (eds), UAI’98: Proc. of the 14th Conference on Uncertainty in Artif. Intell. Morgan Kaufmann Publishers, Inc.

MacKay, D.J.C. 2003. Information Theory, Inference, and Learning Algorithms. Cambridge University Press.

Maier, D. 1983. The Theory of Relational Databases. Pitman.

Marinescu, R., & Dechter, R. 2009a. AND/OR Branch-and-Bound Search for Combinatorial Optimization in Graphical Models. Artif. Intell., 173(16–17), 1457–1491.

Marinescu, R., & Dechter, R. 2009b. Memory Intensive AND/OR Search for Combinatorial Optimization in Graphical Models. Artif. Intell., 173(16–17), 1492–1524.

Menger, K. 1942. Statistical Metrics. Proc. of the National Academy of Sciences of the United States of America, 28, 535–537.

Meyn, S.P., & Tweedie, R.L. 1993. Markov Chains and Stochastic Stability. Springer-Verlag.

Mitten, L.G. 1964. Composition Principles for the Synthesis of Optimal Multi-Stage Processes. Operations Research, 12.

Mohri, M. 2002. Semiring Frameworks and Algorithms for shortest-distance Problems. J. Autom. Lang. Comb., 7(3), 321–350.

Monney, P.-A. 2003. A Mathematical Theory of Arguments for Statistical Evidence. Contributions to Statistics. Physica-Verlag.

Namasivayam, V.N., & Prasanna, V.K. 2006. Scalable Parallel Implementation of Exact Inference in Bayesian Networks. Pages 143–150 of: ICPADS ‘06: Proc. of the 12th Int. Conference on Parallel and Distributed Systems, vol. 1. Washington, DC, USA: IEEE Computer Society.

Nicholson, R., Bridge, D., & Wilson, N. 2006. Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation. Pages 136–150 of: Proc. of the 8th European Conference on Case-Based Reasoning. LNAI 4106. Springer-Verlag.

Nilsson, N.J. 1982. Principles of Artificial Intelligence. Springer-Verlag.

Norman, N.M., & Pollard, S. 1996. Closure Spaces and Logic. Springer-Verlag.

Norris, J.R. 1998. Markov Chains (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press.

Paskin, K., Guestrin, C., & McFadden, J. 2005. A Robust Architecture for Distributed Inference in Sensor Networks. In: IPSN’05: Proc. of the 4th Int. Symposium on Information Processing in Sensor Networks.

Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Company.

Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc.

Pichon, F., & Denoeux, T. 2008. T-Norm and Uninorm-Based Combination of Belief Functions. In: NAFIPS’08: Annual Meeting of the North American Fuzzy Information Processing Society.

Pouly, M. 2008. A Generic Framework for Local Computation. Ph.D. thesis, Department of Informatics, University of Fribourg.

Pouly, M. 2010. NENOK - A Software Architecture for Generic Inference. Int. J. on Artif. Intel. Tools, 19.

Pouly, M., & Kohlas, J. 2005. Minimizing Communication Costs of Distributed Local Computation. Tech. rept. 05–20. Department of Informatics, University of Fribourg.

Pralet, C., Verfaillie, G., & Schiex, T. 2007. An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities and Utilities. J. of Artif. Intell. Research, 29, 421–489.

Radhakrishnan, V., Hunt, H.B., & Stearns, R.E. 1992. Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. Pages 109–119 of: STACS’92: Proc. of the 9th Annual Symposium on Theoretical Aspects of Computer Science. Springer-Verlag.

Robertson, N., & Seymour, P.D. 1983. Graph Minors I: Excluding a Forest. J. Comb. Theory, Ser. B, 35(1), 39–61.

Robertson, N., & Seymour, P.D. 1984. Graph Minors III: Planar Tree-Width. J. Comb. Theory, Ser. B, 36(1), 49–64.

Robertson, N., & Seymour, P.D. 1986. Graph Minors II: Algorithmic Aspects of Tree-Width. J. of Algorithms, 7(3), 309–322.

Rose, D. 1972. A Graph-Theoretic Study of the Numerical Solution of Sparse Positive Definite Systems of Linear Equations. In: Read, R. (ed), Graph Theory and Computing. Academic Press, Inc.

Rose, D.J. 1970. Triangulated Graphs and the Elimination Process. J. of Math. Analysis and Applications, 32, 597–609.

Rossi, F., van Beek, P., & Walsh, T. 2006. Handbook of Constraint Programming. Foundations of Artif. Intell. Elsevier Science, Inc.

Rote, G. 1990. Path Problems in Graphs. Computing Suppl, 7, 155–198.

Roweis, S.T., & Ghahramani, Z. 1999. A Unifying Review of Linear Gaussian Models. Neural Computation, 11(2), 305–345.

Roy, B. 1959. Transitivité et connexité. C. R. Acad. Sci. Paris, 249, 216–218.

Schiex, Th. 1992. Possibilistic Constraint Satisfaction Problems or “How to handle Soft Constraints?”. Pages 268–275 of: UAI’92: Proc. of the 8th Conference on Uncertainty in Artif. Intell. Morgan Kaufmann Publishers, Inc.

Schmidt, T., & Shenoy, P. 1998. Some Improvements to the Shenoy-Shafer and Hugin Architectures for Computing Marginals. Artif. Intell., 102, 323–333.

Schneuwly, C. 2007. Computing in Valuation Algebras. Ph.D. thesis, Department of Informatics, University of Fribourg.

Schneuwly, C., Pouly, M., & Kohlas, J. 2004. Local Computation in Covering Join Trees. Tech. rept. 04-16. Department of Informatics, University of Fribourg.

Schwarz, H.R. 1997. Numerische Mathematik. 4 edn. Teubner.

Schweizer, B., & Sklar, A. 1960. Statistical Metric Spaces. Pacific J. Math., 10, 313–334.

Shafer, G. 1976. A Mathematical Theory of Evidence. Princeton University Press.

Shafer, G. 1982. Belief Functions and Parametric Models. J. Royal Stat. Soc. B, 44(3), 322–352.

Shafer, G. 1991. An Axiomatic Study of Computation in Hypertrees. Working Paper 232. School of Business, University of Kansas.

Shafer, G. 1996. Probabilistic Expert Systems. Society for Industrial and Applied Mathematics.

Shafer, G., & Shenoy, P. 1988. Local Computation in Hypertrees. Tech. rept. School of Business, University of Kansas.

Shafer, G., Shenoy, P.P., & Mellouli, K. 1987. Propagating Belief Functions in qualitative Markov trees. Int. J. Approx. Reasoning, 1(4), 349–400.

Shenoy, P.P. 1992a. Using Possibility Theory in Expert Systems. Fuzzy Sets and Systems, 51(2), 129–142.

Shenoy, P.P. 1992b. Valuation-Based Systems: A Framework for Managing Uncertainty in Expert Systems. Pages 83–104 of: Zadeh, L.A., & Kacprzyk, J. (eds), Fuzzy Logic for the Management of Uncertainty. John Wiley & Sons, Inc.

Shenoy, P.P. 1996. Axioms for Dynamic Programming. Pages 259–275 of: Gammerman, A. (ed), Computational Learning and Probabilistic Reasoning. John Wiley & Sons, Inc.

Shenoy, P.P. 1997. Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture. Int. J. Approx. Reasoning, 17, 239–263.

Shenoy, P.P., & Shafer, G. 1990. Axioms for Probability and Belief-Function Propagation. Pages 575–610 of: Shafer, G., & Pearl, J. (eds), Readings in Uncertain Reasoning. Morgan Kaufmann Publishers, Inc.

Smets, Ph. 2000. Belief Functions and the Transferable Belief Model.

Smets, Ph., & Kennes, R. 1994. The Transferable Belief Model. Artif. Intell., 66(2), 191–234.

Smith, S.W. 1999. The Scientist and Engineer’s Guide to Digital Signal Processing. 2 edn. California Technical Publishing.

Spohn, W. 1988. Ordinal Conditional Functions: A Dynamic Theory of Epistemic States. Pages 105–134 of: Harper, W.L., & Skyrms, B. (eds), Causation in Decision, Belief Change, and Statistics, vol. 2. Dordrecht, Netherlands.

Spohn, W. 1990. A General Non-Probabilistic Theory of Inductive Reasoning. Pages 149–158 of: UAI’88: Proc. of the 4th Conference on Uncertainty in Artif. Intell. Amsterdam, The Netherlands: North-Holland Publishing Co.

Tamura, T., & Kimura, N. 1954. On Decompositions of a Commutative Semigroup. Kodai Math. Sem. Rep., 109–112.

Tarjan, R.E., & Yannakakis, M. 1984. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAMJ. Comput., 13(3), 566–579.

Ullman, J.D. 1988. Principles of Database and Knowledge-Base Systems Volume I. Computer Science Press.

van Leeuwen, J. 1990. Graph Algorithms. Pages 525–631 of: van Leeuwen, J. (ed), Handbook of Theoretical Computer Science: Algorithms and Complexity, vol. A. MIT Press.

Vempaty, N.R. 1992. Solving Constraint Satisfaction Problems using Finite State Automata. Pages 453–458 of: AAAI’92: Proc. of the 10th National Conference on Artif. Intell. AAAI Press.

Wachter, M. 2008. Knowledge Compilation Map - Theory and Application. Ph.D. thesis, Philosophisch-Naturwissenschaftlichen Fakultät, University of Berne.

Wachter, M., & Haenni, R. 2006. Propositional DAGs: A New Graph-Based Language for Representing Boolean Functions. Pages 277–285 of: Doherty, P., Mylopoulos, J., & Welty, C. (eds), KR’06: 10th Int. Conference on Principles of Knowledge Representation and Reasoning. AAAI Press.

Wachter, M., Haenni, R., & Pouly, M. 2007. Optimizing Inference in Bayesian Networks and Semiring Valuation Algebras. Pages 236–247 of: Gelbukh, A., & Kuri Morales, A. F. (eds), MICAI’07: 6th Mexican Int. Conference on Artif. Intell. LNAI 4827.

Warshall, S. 1962. A Theorem on Boolean Matrices. J. of the ACM, 9(1), 11–12.

Wiberg, N. 1996. Codes and Decoding on General Graphs. Ph.D. thesis, Linkoping University, Sweden.

Wilson, N. 2005. Decision Diagrams for the Computation of Semiring Valuations. Pages 331–336 of: UCAI’05: Proc. of the 19th Int. Joint Conference on Artif. Intell. Morgan Kaufmann Publishers, Inc.

Wilson, N., & Mengin, J. 2001. Embedding Logics in the Local Computation Framework. J. of Applied Non-Classical Logics, 11(3–4), 239–261.

Winston, W.L., & Venkataramanan, M. 2002. Introduction to Mathematical Programming: Applications and Algorithms. Vol. 1. Duxbury Press.

Wojcicki, R. 1988. Theory of Logical Calculi: Basic Theory of Consequence Operations. Kluwer, Dordrecht.

Yannakakis, M. 1981. Computing the Minimum Fill-in is NP-Complete. SIAM J. of Algebraic and Discrete Methods, 2(1), 77–79.

Yinglong, X., & Prasanna, V.K. 2008. Junction Tree Decomposition for Parallel Exact Inference. Pages 1–12 of: IPDPS’08: IEEE Int. Symposium on Parallel and Distributed Processing.

Zadeh, L.A. 1978. Fuzzy Sets as a Basis for a Theory of Possibility. Fuzzy Sets and Systems, 1, 3–28.

Zadeh, L.A. 1979. A Theory of Approximate Reasoning. Pages 149–194 of: Ayes, J.E., Michie, D., & Mikulich, L.I. (eds), Machine Intelligence, vol. 9. Ellis Horwood. Chichester, UK.