Atlas home || Conferences | Abstracts | about Atlas
Homepage: http://www.cs.engr.uky.edu/~marek/trento.html
Organizers: T. Eiter (Technische Universität Wien, Vienna, Austria ), G. Gottlob (Technische Universität Wien, Vienna, Austria), V.W. Marek (University of Kentucky, Lexington, Kentucky, USA ), J.B. Remmel (University of California, La Jolla, California, USA )
Description:
tatement of Purpose: In the recent years, there has been a concerted effort to understand the complexity of various problems which arise in database theory,
logics for artificial intelligence, and finite model theory. Moreover in many cases, there are complexity theory results for both finite and infinite examples. These
complexity results are not only interesting in their own right but are important because they can be used to pinpoint the sources of essential complexity inherit in these
problems. Thus these theoretical results can help to direct the search for more efficient algorithms for specific problems as well as to find of classes of problems
where generally complex problems have simpler solutions.
We intend to bring together researchers from three interconnected areas: Database Theory, Logical Foundations of AI and Finite Model Theory in expectation that their interaction will lead to the better comprehension of the fundamental complexity issues within these areas. In addition, this workshop will alert researchers in each specific discipline about the possible applications of the techniques developed in the other disciplines. Each of these areas provides a language which can often illuminate the problems from the other two. As a result we expect to increase the collaboration between the corresponding communities.
Date received: February 07, 1999
© 2008 Atlas Conferences Inc.