Generic Solution Construction in Valuation-Based Systems
- 1.1k Downloads
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying assignments in constraint systems, models in logics or solutions to linear equation systems. Contrary to inference, there is no general algorithm to compute solutions in arbitrary valuation algebras. This paper states formal requirements for the presence of solutions and proposes a generic algorithm for solution construction based on the results of a previously executed inference scheme. We study the application of generic solution construction to semiring constraint systems, sparse linear systems and algebraic path problems and show that the proposed method generalizes various existing approaches for specific formalisms in the literature.
Keywordssolution construction in valuation algebras local computation semiring constraint systems sparse matrix techniques
Unable to display preview. Download preview PDF.
- 2.Bistarelli, S., Montanari, U., Rossi, F., Verfaillie, G., Fargier, H.: Semiring-based csps and valued csps: Frameworks, properties and comparison. Constraints 4(3) (1999)Google Scholar
- 10.Lehmann, D.: Algebraic structures for transitive closure. Technical report, Department of Computer Science, University of Warwick (1976)Google Scholar
- 11.Pouly, M.: A Generic Framework for Local Computation. PhD thesis, Department of Informatics, University of Fribourg (2008)Google Scholar
- 14.Rose, D.: 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, London (1972)Google Scholar
- 16.Shenoy, P.: Valuation-based systems: A framework for managing uncertainty in expert systems. In: Zadeh, L., Kacprzyk, J. (eds.) Fuzzy Logic for the Management of Uncertainty, pp. 83–104. Wiley & Sons, Chichester (1992)Google Scholar
- 17.Shenoy, P.: Axioms for dynamic programming. In: Gammerman, A. (ed.) Computational Learning and Probabilistic Reasoning, pp. 259–275. Wiley & Sons, Chichester (1996)Google Scholar
- 18.Shenoy, P., Shafer, G.: Axioms for probability and belief-function propagation. In: Shafer, G., Pearl, J. (eds.) Readings in Uncertain Reasoning, pp. 575–610. Morgan Kaufmann Publishers, San Francisco (1990)Google Scholar