Loading...
Loading...

Go to the content (press return)

Sufficient and necessary conditions for solution finding in valuation-based systems

Author
Roca, J.; Cerquides, J.; Pouly, M.
Type of activity
Journal article
Journal
International journal of approximate reasoning
Date of publication
2019-11-01
Volume
114
First page
51
Last page
83
DOI
10.1016/j.ijar.2019.08.006
Repository
http://hdl.handle.net/2117/168518 Open in new window
https://arxiv.org/pdf/1508.03523.pdf Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0888613X19301124 Open in new window
Abstract
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 notion of solution. Typical examples are satisfying assignments in constraint systems, models in logics or solutions to linear equation systems. Many widely used dynamic programming algorithms for optimization problems rely on low treewidth decompositions and can be understood as particular cases of a single algorithmic ...
Citation
Roca, J.; Cerquides, J.; Pouly, M. Sufficient and necessary conditions for solution finding in valuation-based systems. "International journal of approximate reasoning", 1 Novembre 2019, vol. 114, p. 51-83.
Group of research
GEOMVAP - Geometry of Manifolds and Applications

Participants

Attachments