Sciweavers

Share
CDB
2004
Springer
143views Database» more  CDB 2004»
9 years 9 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
AIMSA
2004
Springer
9 years 9 months ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
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...
Miguel A. Salido, Federico Barber
AI
2004
Springer
9 years 9 months ago
Constraint Satisfaction Methods for Information Personalization
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...
Syed Sibte Raza Abidi, Yong Han Chong
STACS
2005
Springer
9 years 9 months ago
The Core of a Countably Categorical Structure
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...
Manuel Bodirsky
KCAP
2005
ACM
9 years 9 months ago
Knowledge base reuse through constraint relaxation
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...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
SARA
2007
Springer
9 years 9 months ago
DFS-Tree Based Heuristic Search
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...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
CIE
2007
Springer
9 years 10 months ago
Computational Complexity of Constraint Satisfaction
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...
Heribert Vollmer
ATAL
2007
Springer
9 years 10 months ago
Unifying distributed constraint algorithms in a BDI negotiation framework
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Bao Chau Le Dinh, Kiam Tian Seow
CP
2009
Springer
9 years 10 months ago
Dialectic Search
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...
Serdar Kadioglu, Meinolf Sellmann
CP
2009
Springer
10 years 4 months ago
Failed Value Consistencies for Constraint Satisfaction
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...
Christophe Lecoutre, Olivier Roussel
books