Compiling solution configurations in semiring valuation systems

Authors:
Marc Pouly;Rolf Haenni;Michael Wachter
Affiliations:
University of Fribourg, Switzerland;Bern University of Applied Sciences, Switzerland and University of Bern, Switzerland;University of Bern, Switzerland
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 9
Cited 0

Valuation-based systems: a framework for managing uncertainty in expert systems

Fuzzy logic for the management of uncertainty
Decomposable negation normal form

Journal of the ACM (JACM)
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Axioms for probability and belief-function proagation

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Information Algebras: Generic Structures for Inference

Information Algebras: Generic Structures for Inference
A knowledge compilation map

Journal of Artificial Intelligence Research
Decision diagrams for the computation of semiring valuations

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes a new method for solving optimization queries in semiring valuation systems. In contrast to existing techniques which focus essentially on the identification of solution configurations, we propose foremost the construction of an implicit representation of the solution configuration set in the shape of a Boolean function. This intermediate compilation step allows then to efficiently execute many further relevant queries that go far beyond the traditional task of enumerating solution configurations.