Πανεπιστήμιο Αιγαίου
Τμήμα Μηχ/κών Πληρ/κών & Επικ/κών Συστ/των

University of the Aegean
Dept. of Information and Communication Systems Eng.


Ελληνική Εταιρεία Τεχνητής Νοημοσύνης


Hellenic Society of Artificial Intelligence

Home
Up
Ανακοινώσεις
Πρόγραμμα
Επιτροπές
Εγγραφή
Υποβολή Εργασιών
Εκδηλώσεις
Σαμος
Χορηγοί


3ο Πανελλήνιο Συνέδριο Τεχνητής Νοημοσύνης

Ελληνική Εταιρεία Τεχνητής Νοημοσύνης
Τμήμα Μηχ/κών Πληρ/κών & Επικ/κών Συστημάτων

5-8 Μαΐου 2004
Ξενοδοχείο "DORYSSA BAY", Πυθαγόρειο, Σάμος


Εκδηλώσεις


Προσκεκλημένη ομιλία

Dynamic Discovery, Invocation and Composition
of Semantic Web Services

Katia P. Sycara
School of Computer Science
Carnegie Mellon University

 

Abstract. While the Web is the largest World Wide repository of digitized information, by and large, the very same information is not available for automatic computation. In recent years two parallel efforts emerged that have the potential of overcoming this paradox: the first effort is the Semantic Web which provides the tools for the explicit markup of the content of Web pages so they can be computer understandable; the second effort is the development of Web Services which results in a Web where programs act as independent agents to become the producers and consumers of information and enable automation of business transactions.

In this paper we present research that bridges the gap between the Web as we know it, the Semantic Web and Web services. We present the vision of Semantic Web services as autonomous goal-directed agents which select other agents to interact with, and flexibly negotiate their interaction model. In particular, we present our work on run time semantic discovery of Web services, Web service invocation and composition.

 

Προσκεκλημένη ομιλία

Constraint Satisfaction, Complexity, and Logic

Phokion G. Kolaitis
Computer Science Department
University of California, Santa Cruz

 

Abstract. Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several different areas of computer science and artificial intelligence. In their full generality, constraint satisfaction problems are NP-complete and, hence, presumed to be algorithmically intractable. For this reason, extensive research efforts have been devoted to the pursuit of "islands of tractability" of constraint satisfaction, that is, special cases of constraint satisfaction problems for which polynomial-time algorithms exist.

The aim of this talk is to present an overview of recent advances in the investigation of the computational complexity of constraint satisfaction with emphasis on the connections between "islands of tractability" of constraint satisfaction, database theory, definability in finite-variable logics, and structures of bounded treewidth.

Copyright © 2003-2004 ΣΕΤΝ-04
Τελευταία ενημέρωση: 30/03/2004
Για σχόλια και παρατηρήσεις:
setn04@aegean.gr

Copyright © 2003-2004 SETN-04
Last update: 30/03/2004
For comments:
setn04@aegean.gr