118 views175 votes15 years 10 months ago CSCLP 2004»
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
87 views129 votes15 years 10 months ago KCAP 2005»
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
180 views131 votes15 years 5 months ago ATAL 2010»
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
114 views139 votes15 years 6 months ago AAAI 1996»
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
99 views146 votes15 years 5 months ago IJCAI 1993»
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
108 views128 votes15 years 10 months ago AIMSA 2004»
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...