PUMA
Istituto di Informatica e Telematica     
Bistarelli S. Abstracting soft constraints: framework, properties, examples. In: ARTIFICIAL INTELLIGENCE (16071J0), vol. 139-2 pp. 175 - 211. Elsevier, 2002. [Online First 01 August 2002]
 
 
Abstract
(English)
Soft constraints are very and expressive. However, they also are very complex to handle. For this reason, it may be reasonable in several cases to pass to an abstract version of a given soft constraint problem, and then to bring some useful information from the abstract problem to the concrete one. This will hopefully make the search for a solution, or for an optimal solution, of the concrete problem, faster. In this paper we propose an abstraction scheme for soft constraint problems and we study its main properties. We show that processing the abstracted version of a soft constraint problem can help us in finding good approximations of the optimal solutions, or also in obtaining information that can make the subsequent search for the best solution easier. We also show how the abstraction scheme can be used to devise new hybrid algorithms for solving soft constraint problems, and also to import constraint propagation algorithms from the abstract scenario to the concrete one. This may be useful when we don't have any (or any efficient) propagation algorithm in the concrete setting.
DOI: 10.1016/S0004-3702(02)00208-4
Subject Abstraction, Constraint solving, Soft constraints, Fuzzy reasoning, Constraint propagation
C.2


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional