Federated database systems for managing distributed, heterogeneous, and autonomous databases
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
Infomaster: an information integration system
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Agent-based semantic interoperability in infosleuth
ACM SIGMOD Record
Encodings of non-binary constraint satisfaction problems
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
The Evolving Role of Constraints in the Functional Data Model
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Flexible and scalable cost-based query planning in mediators: a transformational approach
Artificial Intelligence - Special issue on Intelligent internet systems
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
International Journal of Human-Computer Studies - Special issue on Awareness and the WWW
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Constraint Propagation and Value Acquisition: Why we should do it Interactively
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Metrics for Evaluating Database Selection Techniques
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
CCL: Expressions of Choice in Agent Communication
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Just-in-time information retrieval agents
IBM Systems Journal
Extracting constraint satisfaction subproblems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Incentive compatible open constraint optimization
Proceedings of the 4th ACM conference on Electronic commerce
Incentive compatible open constraint optimization
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
On the computational limits of infinite satisfaction
Proceedings of the 2005 ACM symposium on Applied computing
Bumping strategies for the multiagent agreement problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Partially defined constraints in constraint-based design
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Making the breakout algorithm complete using systematic search
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Dealing with incomplete preferences in soft constraint problems
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A cost-based model and algorithms for interleaving solving and elicitation of CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Open constraints in a closed world
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A note on bilattices and open constraint programming
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
| Hi-index | 0.00 |
Traditionally, constraint satisfaction has been applied in closed-world scenarios, where all choices and constraints are known from the beginning and fixed. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where choices and constraints are to be discovered from different servers in a network.We examine how such a distributed setting affects changes the assumptions underlying most CSP algorithms, and show how solvers can be augmented with an information gathering component that allows open-world constraint satisfaction. We report on experiments that show strong performance of such methods over others where gathering information and solving the CSP are separated.