Sciweavers

287 search results - page 18 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
FLAIRS
2004
13 years 9 months ago
Constraint Processing with Reactive Agents
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
Georg Ringwelski, Richard J. Wallace
ECSQARU
2009
Springer
13 years 5 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
AAAI
2006
13 years 9 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
CP
2006
Springer
13 years 11 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...
CP
2006
Springer
13 years 11 months ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...