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.
Graphical models are one of the most prominent frameworks to model complex systems and efficiently q...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the defi...
This paper describes a new approach to computation in a semiring-based system, which includes semiri...
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the defi...
We introduce a general framework for constraint satisfaction and optimization where classi-cal CSPs,...
Constraint optimization is at the core of many problems in Artificial Intelligence. In this paper, w...
Interpretations of logical formulas over semirings (other than the Boolean semiring) have applicatio...
In combinatorial optimization, the more complex a problem is, the more challenging it becomes, usual...
We present a variant of the Weighted Maximum Satisfia-bility Problem (Weighted MaxSAT), which is a m...
The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the represen...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
This paper tackles the problem of finding the list of solutions with strictly increasing cost for th...
Assignment problems are about the best way of matching the elements of a first set with the elements...
Graphical models are one of the most prominent frameworks to model complex systems and efficiently q...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the defi...
This paper describes a new approach to computation in a semiring-based system, which includes semiri...
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the defi...
We introduce a general framework for constraint satisfaction and optimization where classi-cal CSPs,...
Constraint optimization is at the core of many problems in Artificial Intelligence. In this paper, w...
Interpretations of logical formulas over semirings (other than the Boolean semiring) have applicatio...
In combinatorial optimization, the more complex a problem is, the more challenging it becomes, usual...
We present a variant of the Weighted Maximum Satisfia-bility Problem (Weighted MaxSAT), which is a m...
The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the represen...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
This paper tackles the problem of finding the list of solutions with strictly increasing cost for th...
Assignment problems are about the best way of matching the elements of a first set with the elements...
Graphical models are one of the most prominent frameworks to model complex systems and efficiently q...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...