| Reference : Generic Solution Construction in Valuation-Based Systems |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science Engineering, computing & technology : Multidisciplinary, general & others | |||
| http://hdl.handle.net/10993/16004 | |||
| Generic Solution Construction in Valuation-Based Systems | |
| English | |
| Pouly, Marc [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SnT) >] | |
| 2011 | |
| Advances in Artificial Intelligence | |
| Butz, Cory | |
| Lingras, Pawan | |
| Springer | |
| Lecture Notes in Computer Science, 6657 | |
| 335 - 346 | |
| No | |
| 978-3-642-21042-6 | |
| 24th Canadian Conference on Artificial Intelligence | |
| 25-27 May 2011 | |
| St. John's, NL | |
| Canada | |
| [en] 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. | |
| http://hdl.handle.net/10993/16004 | |
| 10.1007/978-3-642-21043-3_41 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
