Sciweavers

CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 4 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
CLIMA
2004
13 years 5 months ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
CP
2008
Springer
13 years 6 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...