CDB
2004
Springer
14 years 5 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
AIMSA
2004
Springer
14 years 5 months ago
2004
Springer
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...
AI
2004
Springer
14 years 5 months ago
2004
Springer
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
STACS
2005
Springer
14 years 5 months ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
KCAP
2005
ACM
14 years 5 months ago
2005
ACM
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...
SARA
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
CIE
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
ATAL
2007
Springer
14 years 6 months ago
2007
Springer
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
CP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
CP
2009
Springer
15 years 15 days ago
2009
Springer
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...