Open constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 356-371

  Faltings, Boi ^a   Macho Gonzalez, Santiago ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT SATISFACTION; INFORMATION GATHERING; OPEN WORLD; SCHEDULING AND PLANNING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957017657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_24     Document Type: Conference Paper

References (25)

1. Genesereth M. R.,K eller, A. M. Duschka, O.: “Infomaster: An Information Integration System”,Pro ceedings of 1997 ACM SIGMOD Conference, May 1997
2. Marian Nodine,Jerry Fowler,T omasz Ksiezyk,Brad Perry, Malcolm Taylor and Amy Unruh: Active Information Gathering in InfoSleuth In International Journal of Cooperative Information Systems 9:1/2,2000,p p. 3-28.
3. Jerry Fowler,Brad Perry, Marian Nodine, and Bruce Bargmeyer: Agent-Based Semantic Interoperability in InfoSleuth SIGMOD Record 28:1,March, 1999,p p. 60-67.
4. Alon Y. Levy,A nand Rajaraman, Joann J. Ordille:”Querying Heterogeneous Information Sources Using Source Descriptions,” Proceedings of the 22nd VLDB Conference,Bom bay, India, 1996.
5. Rita Cucchiara,Marco Gavanelli, Evelina Lamma,P aola Mello, Michela Milano, and Massimo Piccardi: “Constraint propagation and value acquisition: why we should do it interactively,” Proceedings of the 16th IJCAI,M organ Kaufmann, pp.468-477,1999.
6. R. Cucchiara, E. Lamma, P. Mello, M. Milano: “Interactive Constraint Satisfaction,”, Technical Report DEIS-LIA-97-00, University of Bologna, 1997
7. Christian Bessiére:”Arc-Consistency in Dynamic Constraint Satisfaction Problems,” Proceedings of the 9th National Conference of the AAAI,p p. 221-226, 1991.
8. Sanjay Mittal and Brian Falkenhainer: “Dynamic constraint satisfaction problems,” Proceedings of the 8th National Conference of the AAAI,p p. 25-32, 1990.
9. Makoto Yokoo:”Asynchronous Weak-commitment Search for Solving Large-Scale Distributed Constraint Satisfaction Problems,” Proceedings of the First International Conference on Multi–Agent Systems, p. 467,MIT Press,1995.
10. Peter M.D., Gray Suzanne, M. Embury, Kit Y. Hui Graham, J. L. Kemp:”The Evolving Role of Constraints in the Functional Data Model”, Journal of Intelligent Information Systems 12,p p. 113-137, 1999
11. Monique Calisti, Boi Faltings, Santiago Macho-Gonzalez, Omar Belakhdar and Marc Torrens: “CCL: Expressions of Choice in Agent Communication,” Fourth International Conference on MultiAgent Systems (ICMAS-2000),B oston MA, USA., July,2000
12. A. Sheth and J.A. Larson:”Federated Database Systems,” ACM Computing Surveys 22(3),1990.
13. S. Chawathe, H. Garcia Molina, J. Hammer, K. Ireland, Y. Papakostantinou, J. Ullman and J. Widom: The TSIMMIS project: Integration of heterogeneous information sources. In IPSJ Conference,Tokyo, Japan, 1994.
14. José Luis Ambite and Craig Knoblock:”Flexible and scalable cost-based query planning in mediators: A transformational approach,” Artificial Intelligence 118, pp. 115-161,2000.
15. Keith Decker, K atia Sycara and Mike Williamson:”Middle-Agents for the Internet,” Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97),Morgan Kaufmann, 1997, pp. 578-583.
16. Sycara K.”In-Context Information Management Through Adaptive Collaboration of Intelligent Agents.” In Intelligent Information Agents: Cooperative,R ational and Adaptive Information Gathering on the Internet. Matthias Klusch (Ed.), Springer Verlag,1999.
17. Katia Sycara, Seth Widoff, Matthias Klusch and Jianguo Lu:”LARKS: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace.” Autonomous Agents and Multi-Agent Systems,5,173- 203, 2002.
18. J. Budzik, S. Bradshaw, X. Fu, and K. Hammond: “Supporting Online Resource Discovery in the Context of Ongoing Tasks with Proactive Assistants,” International Journal of Human-Computer Studies 56(1) Jan 2002,p p. 47-74.
19. B. J. Rhodes and P. Maes:”Just-in-time information retrieval agents,” IBM Systems Journal 39,p p. 685-704, 2000.
20. F. Rossi, C. Petrie and V. Dhar: “On the equivalence of constraint satisfaction problems,” Proceedings of ECAI-90,p p. 550-556, 1990
21. K. Stergiou and T. Walsh: “Encodings of Non-binary Constraint Satisfaction Problems,” Proceedings of AAAI-99,ppp. 163-168, AAAI Press, 1999.
22. N. Mamoulis and K. Stergiou: “Solving Non-binary CSPs Using the Hidden Variable Encoding,” Proccedings of CP 2001,LNCS 2239, Springer-Verlag, pp. 168- 182,2001.
23. P. Prosser: “Hybrid Algorithms for Constraint Satisfaction Problems,” Computational Intellligence 9(3),pp. 268-299, 1993.
24. Eugene Freuder and Paul Hubbe:”Extracting Constraint Satisfaction Subproblems,” Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 548-555, 1995.
25. James C. Freanch and Allison L. Powell:Metrics for Evaluating Database Selection Techniques. 2000.