The Conference

The 21st  International Conference on  Logic Programming will  be held near Barcelona (Spain) from October  2nd to October 5th, 2005. ICLP'05 will be colocated  with the International Conference on Principles and Practice of Constraint Programming (CP'05).

Conference scope

Since the first  conference held in Marseilles in  1982, ICLP has been the premier international conference  for presenting research in logic programming.  Contributions (papers  and  posters) are  sought in  all areas of logic programming including but not restricted to:

Theory
Semantic Foundations 
Formalisms
Nonmonotonic Reasoning 
Virtual Machines
Knowledge Representation

Implementation
Compilation
Memory Management
Memory Management
Parallelism

Environments
Program Analysis
Program Transformation
Validation and Verification
Debugging, Profiling

Alternative Paradigms
Constraint Logic Programming
Abductive Logic Programming
Inductive Logic Programming
Answer Set Programming

Language Issues 
Concurrency
Objects
Coordination
Mobility
 Higher Order
Types
Modes
Programming Techniques

Applications
Semantic Web
Software Engineering
Web Tools
Internet Agents
Artificial Intelligence
Deductive Databases
Natural Language

Specific attention will be  given to work providing novel integrations of these different areas, and to new applications of logic programming in  general. Contributions on  applications will  be assessed  with an emphasis on their  impact and synergy with other  areas, as opposed to technical maturity. Applications of  logic programming to the Semantic Web are especially encouraged.

The technical program will  include several invited talks and advanced tutorials, in addition to the presentations of the accepted papers and posters.  A  special  session  on  industrial  applications  of  logic programming  is also  planned and  several workshops  will be  held in parallel with the  conference. For the first time,  a doctoral student consortium will be organized as part of ICLP.

Papers

Papers  must describe original,  previously unpublished  research, and must not  be simultaneously submitted for  publication elsewhere. They must be  written in English and  not exceed 15 pages  in Springer LNCS format.  The  authors are encouraged, although not  obliged, to submit their  papers already  in  Springer LNCS  format. General  information about the Springer LNCS series  and the LNCS authors' instructions are available     at     the      Springer     LNCS/LNAI     home     page

Papers should express their  contribution clearly, both in general and technical terms.  It is essential  to identify what  was accomplished, describe its significance, and explain how the paper compares with and advances previous work.  Authors should make every effort  to make the technical content understandable to a broad audience.

The primary means of submission  will be electronic, in pdf format. If electronic submission is not possible, five hard copies should be sent to one  of the program  co-chairs. More information on  the submission procedure will be available at http://www.utdallas.edu/ICLP05

Industrial Papers

A special  session on industrial applications of  logic programming is also planned  during the conference.  Papers accepted in  this session will  describe   innovative  applications  of   logic  programming  to industrial problems.  The application's innovativeness  and industrial impact will  be the main criteria  used for judging  the paper. Papers accepted  for this  session will  be published  in the  proceedings as shorter, (up to) 10 pages papers.

Posters

Posters  provide  a forum  for  presenting  work  in an  informal  and interactive setting.   They are ideal for discussing  current work not yet  ready for  publication,  for PhD  thesis  summaries and  research project overviews.   Accepted posters will  also get a 10  minute slot for presentation  during the conference.  Extended  abstract (2 pages) of each accepted poster will be published in the proceedings.

Posters  must be  submitted  electronically. More information on  the submission procedure will be available at

Doctoral Student Consortium

The  Doctoral  Consortium will  provide  an  opportunity for  students pursuing their doctoral thesis  in logic programming and related areas to explore their  research interests under the guidance  of a panel of distinguished experts in the  field. The Doctoral Consortium will also offer  invited speakers  and discussion  groups.  The  Consortium will allow participants  to interact with established  researchers and with other students, through presentations, question-answer sessions, panel discussions, and invited presentations.

A  separate call-for-participation  will  be issued  for the  doctoral consortium. About 6 to 8 students will be selected for the consortium. Selected  students will  also  present their  research  in the  poster session.  The  abstract  of  the  poster  will  be  published  in  the conference proceedings. Financial support for selected students may be available.

Publication

The proceedings of the conference will be published by Springer-Verlag in the LNCS  series. The proceedings will include  the accepted papers and the abstracts of accepted posters.

Sponsoring and prizes

The conference is sponsored  by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants.
The ALP  is planning to sponsor  two prizes for ICLP'05:  for the best technical paper and for the best application paper.


Important dates

Organization

Conference Co-Chairs:     
	Pedro Meseguer (IIIA-CSIC, Spain)
	Javier Larrosa (Technical University of Catalonia, Spain)

Program Co-Chairs:         
Maurizio Gabbrielli (University of Bologna, Italy)
Gopal Gupta (University of Texas at Dallas, USA)

Workshop Chair:            
Hai-Feng Guo (University of Nebraska at Omaha, USA)

Doctoral Consortium Chair: 
Enrico Pontelli (New Mexico State University, USA)

Publicity Chair:           
Felip Manya (IIIA-CSIC, Spain)

Program Committee:

Roberto Bagnara 

University of Parma, Italy

Maurice Bruynooghe

KU Leuven, Belgium

Giorgio Delzanno

University of Genova, Italy

Stefan Decker

Digital Enterprise Research Institute, Ireland

Thom Fruwirth

University of Ulm, Germany

Maurizio Gabbrielli

University of Bologna, Italy (Program Co-Chair)

Gopal Gupta 

University of Texas at Dallas, USA (Program Co-Chair)

Patricia Hill

University of Leeds, UK

Joxan Jaffar

University of Singapore, Singapore

Bharat Jayaraman

SUNY Buffalo, USA

Javier Larrosa

Technical University of Catalonia, Spain (Conference Co-Chair)

Michael Leuschel  

University of Southampton, UK

Massimo Marchiori 

University of Venice, Italy and W3C, MIT, USA

Pedro Meseguer

IIIA-CSIC, Spain (Conference Co-Chair)

Juan J. Moreno Navarro

Technical University of Madrid, Spain

Gopalan Nadathur

University of Minnesota, USA

Illka Niemela 

Helsinki U. of Tech. Finland

Catuscia Palamidessi

 INRIA, France

Enrico Pontelli

New Mexico State University, USA

I.V. Ramakrishnan

SUNY Stony Brook, USA

Vitor Santos Costa

Federal U. of Rio de Janeiro, Brazil

Harald Sondergaard 

University of Melbourne, Australia

Peter Stuckey

University of Melbourne, Australia

Frank Valencia

University of Uppsala, Sweden

Contact addresses

Conference Chairs:

Pedro Meseguer

Javier Larrosa

IIIA-CSIC 

Dep. LSI, UPC

Campus UAB 

Jordi Girona 1-3

08193 Bellaterra, Spain

08034 Barcelona, Spain

Program Co-chairs: iclp05-chairs@cs.unibo.it

Maurizio Gabbrielli

Gopal Gupta

Department of Computer Science

Department of Computer Sciences MS EC31

University of Bologna

The University of Texas at Dallas

Mura A. Zamboni 7

2601 N. Floyd Rd

40127 Bologna, Italy

Richardson, TX 78050, USA

ICLP'05, the 21st International Conference on Logic Programming, will be held in Sitges(Barcelona), Spain, from October 2 to October 5, 2005. We plan to have several workshops in parallel with the conference.

Workshops have a key role in Logic Programming Conferences. They provide an ideal platform for the presentation of preliminary work or novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The topics of the workshops can cover any areas related to logic programming, including cross-disciplinary areas.  

To encourage active participation and exchange of ideas, the workshops will be kept small, preferably under 40 participants. The format of the workshop will be determined by the organizer(s) proposing the workshop, but ample time must be allowed for general discussion. Workshops can vary in length, but the optimal duration will be half a day or a full day. Having two or three co-organizers for a workshop is strongly advised.

Workshop Proposal:
The persons intending to organize a workshop at ICLP'05 are invited to submit a workshop proposal. Proposals should be in English and about two pages in length. They should contain:

• the title of the workshop
• a brief technical description of the topics covered by the workshop
• a discussion of the timeliness and relevance of the workshop
• the names, affiliation and contact details (email, web page, phone, fax) of the workshop organizing committee together with a designated contact person as the workshop coordinator
• a preliminary plan/schedule for organizing the workshop, including the required number of half-days allotted to the workshop
• a list of previously-organized related workshops by any of the workshop organizing committee. Although previous experience with organizing similar workshops is not required, this information will be helpful to the Workshop Chair
• an estimated number of attendants to the workshop
  

Proposals are expected in ASCII or LaTeX format. All proposals should be submitted to the Workshop Chair by email by March 31, 2005.

Workshop Organizers' Tasks:

• Producing a "Call for Papers" for the workshop and posting it on the net and/or other means. Please provide a web page URL which can be linked into the ICLP'05 home page by May 5, 2005.
• Providing a brief description of the workshop for the conference program.
• Reviewing/accepting submitted papers.
• Scheduling workshop activities in collaboration with the local organizers and the workshop chair.
• Sending workshop proceedings in LaTeX format to the workshop chair for printing, by August 31, 2005 (if the proceedings are to be printed by the local organizers)

Reviewing Process:
Each submitted proposal is reviewed by the Workshops Chair and the Conference Program Chairs. Proposals that appear well-organized and that fit the goals and scope of ICLP will be selected.  The decision will be notified by email to the responsible organizer by April 13, 2005. 

The definitive length of the workshop will be planned according to the number of submissions received by the different workshops. For every accepted workshop, the ICLP local organizers will prepare a meeting place and can print the workshop proceedings, whose LaTeX preparation is however in charge to the workshop organizers. The workshop registration fees will be handled together with the conference fees.

Workshop Location:
The workshops will be held on October 5th, in parallel with the 21st  International Conference on Logic Programming (ICLP'05). ICLP'05 will  be held in Sitges(Barcelona), Spain. Sitges is a town 15 minutes away from  the Barcelona international airport and 30 minutes from the center of Barcelona. The town of Sitges is situated in the Catalan region  of Spain, and it is a well-established tourist resort and residential area thanks to its warm climate and fantastic natural panoramic views. The conference will be held at Melia Sitges Hotel, located on the sea-front facing the Mediterranean and is within five-minute walking distance from the city center.

Important Dates:
March 31, 2005:   Proposal submission deadline 
April 13, 2005:   Acceptance notification
May 5, 2005:      Deadline for receipt of CFP and URL for workshop web page
August 31, 2005:  Deadline for workshop working notes
October 5, 2005:  ICLP 2005 workshops

Workshop Chair:

•   To provide doctoral students working in the field of  logic programming with a friendly and open forum to  present their research ideas, listen to ongoing work from peer students, and receive constructive feedback
•   To provide  students with relevant information about important issues for doctoral candidates and future academics
•   To develop a supportive community of scholars and a spirit of collaborative research.
•   To support a new generation of researchers with information and advice on academic, research, industrial, and non-traditional career paths.

•   Theoretical Foundations of Logic and Constraint Logic Programming
•   Sequential and Parallel Implementation Technology
•   Static and Dynamic Analysis, Abstract Interpretation, Compilation Technology, Verification
•   Logic-based Paradigms (e.g., Answer Set Programming, Concurrent Logic Programming, Inductive Logic Programming)
•   Innovative Applications of Logic Programming

The CP conference is the annual international conference on constraint programming, and it is concerned with all aspects of computing with constraints, including: algorithms, applications, environments, languages, models, and systems.  CP 2005 includes a technical program, where presentations of theoretical and application papers, as well as invited talks and tutorials, aim at describing the best results and techniques in the state-of-the-art of constraint programming. Moreover, CP 2005 continues the tradition of the CP doctoral program, in which PhD students can present their work, listen to tutorials on career and ethical issues, and discuss their work with senior researchers via a mentoring scheme. There will also be a number of workshops, where researchers will be able to meet in an informal setting and discuss their most recent ideas with their peers.

Technical Program

The technical programme is concerned with all aspects of computing with constraints including: algorithms, applications, environments, languages, models, systems. Papers are solicited from any of the disciplines concerned with constraints, including: artificial intelligence, combinatorial algorithms, computational logic, concurrent computation, databases, discrete mathematics, engineering, operations research, programming languages, symbolic computation.

Papers may concern any of the domains using constraints, including: combinatorial auctions, computational linguistics, configuration, decision support, design, diagnosis, graphics, hardware verification, molecular biology, planning, program analysis, qualitative reasoning, real-time systems, resource allocation, robotics, satisfiability, scheduling, software engineering, temporal reasoning, type inference, vision, visualization, user interfaces. We especially welcome papers discussing novel reasoning and search methods, presenting original applications of constraint programming, building bridges between constraint programming and other areas, or providing fundamental theoretical insights in explaining the success or failure of existing methods. The call for papers can be found here (.ps, .pdf, .doc, .txt).

Submission Details

Summitted papers to the technical program must be original and not submitted for publication in a journal or another conference. Authors are required to prepare their papers by following the LNCS style. A page limit of 15 will be strictly enforced. The proceedings, comprising papers accepted as full length (15 pages) or short (5 pages), will be published by Springer in the Lecture Notes in Computer Science series. The paper submission deadline is May 6th, 2005. Details about how to submit papers electronically will be posted here.

Workshop Program

CP 2005 will include a series of workshops. The workshops will provide an informal setting where workshop participants will have the opportunity to discuss specific technical topics in an atmosphere that fosters the active exchange of ideas. Workshops are an opportunity to disseminate work in progress or to promote new and emerging areas within the field of constraints. The topics of the workshops can cover any area related to constraints and any related cross-disciplinary areas. The call for workshop proposals can be found here (.txt).

Tutorial Program

CP 2005 will include a number of tutorials. The tutorials will give a state-of-the-art description of a field of research related to constraint programming or of a large area of application. The call for tutorial proposals can be found here (.txt).

Doctoral Program

A special program for PhD students will be held alongside the conference. Students will be able to present their work and receive feedback from more senior members of the community. In addition, there will be tutorials about research skills and career issues. The call for doctoral program submissions can be found here (.html, .txt).

Important Dates
 

Deadline for workshop proposals: Notification of accepted workshops: Deadline for paper submission: Deadline for doctoral program submission: Deadline for tutorial proposals: Notification of accepted tutorials: Notification of accepted papers: Notification of acceptance to doctoral program: Camera-ready copy due: Deadline for early conference registration: CP 2005 Conference:

March 31st April 13th May 6th May 16th May 21st June 13th June 24th June 30th July 15th July 29th October 1st-5th

• Declarative agent communication and coordination languages
• Declarative approaches to the engineering of agent systems
• Experimental studies of declarative technologies
• Industrial and commercial experiences with declarative agent technologies
• Formal methods for the specification and verification of agent systems
• Computational logics in multi-agent systems
• Model Checking MAS
• Declarative description of contracts and negotiation issues
• Lessons learned from the design and implementation of agent systems
• Declarative paradigms for the combination of heterogeneous agents
• Constraints and agent systems
• Declarative policies and security in MAS
• Knowledge-based and knowledge-intensive MAS
• Modeling of agent rationality

• Programming Languages for multi-agent systems
• Extensions of traditional languages for multi-agent programming
• Theoretical and practical aspects of multi-agent programming
• Computational complexity of MAS
• Semantics for multi-agent programming languages
• High-level executable multi-agent specification languages
• Algorithms, techniques, or protocols for multi-agent issues (e.g., coordination, cooperation, negotiation)
• Agent communication issues in multi-agent programming
• Implementation of social and organisational aspects of MAS
• Formal methods for specification and verification of MAS
• Verification tools for implementations of MAS
• Agent development tools and platforms
• Generic tools and infrastructures for multi-agent programming
• Interoperability and standards for MAS
• Programming mobile agents
• Safety and security for mobile MAS deployment
• Fault tolerance and load balancing for mobile MAS
• Application areas for multi-agent programming languages
• Applications using legacy systems
• Programming MAS for Grid-based applications
• Programming MAS for the Semantic Web
• Deployed (industrial-strength) MAS
• Benchmarks and testbeds for comparing MAS languages and tools

• IFIP WG 1.7
• CNR-IIT, Pisa
• Create-Net
• University of Bologna

• Noel Sharkey (University of Sheffield)
• Mark Shackleton (BT, Pervasive ICT Research Centre)

• be in PDF or postscript format;
• be in Springer LNCS style ;
• have a maximum length of 10 pages.

•      Submission deadline: 13th May 2005
•      Notification to authors: 15th July 2005
•      Camera ready copy due: 1st August 2005
•      Early registration deadline: 1st August 2005
•      Conference: 7th-9th September 2005

Computer security is an established field of Computer Science of both theoretical and practical significance. In recent years, there has been increasing interest in foundations for various methods in computer security, including the formal specification, analysis and design of cryptographic protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, trust management, and the modeling of information flow and its application to confidentiality policies, system composition, and covert channel analysis.

The aim of this workshop is to provide a forum for continued activity in this area, to bring computer security researchers in contact with the LICS'05 community, and to give LICS attendees an opportunity to talk to experts in computer security.

TOPICS
We are interested both in new results in theories of computer security and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories. Possible topics include, but are not limited to:

Composition issues             		     Authentication
Formal specification             	      Availability and denial of service
Foundations of verification   		   Covert channels
Information flow analysis                   Cryptographic protocols
Language-based security                 Confidentiality
Logic-based design               for       Integrity and privacy
Program transformation                    Intrusion detection
Security models                                Malicious code
Static analysis                                  Mobile code
Statistical methods                           Mutual distrust
Trust management                           Security policies

SUBMISSION INSTRUCTIONS
See http://www.cs.chalmers.se/~andrei/FCS05/

The proceedings will be distributed to all participants of the workshop and will be made available in electronic format. The authors of the best papers might be invited to submit an extended revision for inclusion in a special issue of a journal.

IMPORTANT DATES
Submission deadline:                 March 18, 2005
Notification of acceptance:         May 6, 2005
Final papers:                              May 20, 2005
Workshop:                                 June 30 - July 1, 2005

PROGRAM COMMITTEE
Michael Backes (IBM Zurich, Switzerland)
Gilles Barthe (INRIA, France)
Iliano Cervesato (Tulane University, USA)
Sabrina De Capitani di Vimercati (University of Milano, Italy)
Joshua Guttman (MITRE Corporation, USA)
Joe Halpern (Cornell University, USA)
Naoki Kobayashi (Tohoku University, Japan)
Ralf Kuesters (University of Kiel, Germany)
Cathy Meadows (NRL, USA)
John Mitchell (Stanford University, USA)
Frank Pfenning (Carnegie-Mellon University, USA)
Mark Ryan (University of Birmingham, UK)
Andrei Sabelfeld (Chalmers, Sweden - Chair)
Vitaly Shmatikov (University of Texas at Austin, USA)

WORKSHOP WEB PAGE AND FURTHER INFORMATION

FCS05: http://www.cs.chalmers.se/~andrei/FCS05/

LICS05: http://homepages.inf.ed.ac.uk/als/lics/lics05/

The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development; the workshop is open to contributions in logic-based program development in any language paradigm.

LOPSTR'05 will be held at Imperial College in London co-located with SAS 2005: The International Static Analysis Symposium

Previous LOPSTR events were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, the Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), Madrid, Spain (2002), Uppsala, Sweden (2003), Verona, Italy (2004). Since 1994 the proceedings have been published in the LNCS series of Springer-Verlag.

LOPSTR has a reputation for being a lively, friendly forum for presenting new work and discussing work in progress, so it is a real workshop in the sense that it is also able to provide useful feedback to authors on their preliminary research. Formal proceedings of the workshop are produced only after the workshop, so that authors can incorporate this feedback in the published papers.


Scope of LOPSTR
We solicit extended abstracts and full papers.  Topics of interest cover all aspects of logic-based program development all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large.

The following is a non-exhaustive list of topics:

• specification
• synthesis
• verification
• transformation
• specialisation
• analysis
• optimisation
• composition
• reuse
• applications and tools
• proofs as programs
• component-based software development
• agent-based software development
• software architectures
• design patterns and frameworks
• program refinement and logics for refinement

Submission Guidelines
Authors can either submit extended abstracts describing work in progress or they can choose to submit full papers. Contributions should be written in English and should be submitted electronically in Postscript or PDF format at

Authors are also asked to send the title and abstract of their submission three days before the deadline to lopstr05@comp.leeds.ac.uk.  Prospective authors who have difficulties for the electronic submission may contact the chairman at lopstr05@comp.leeds.ac.uk.

Extended abstracts should not exceed 6 pages in llncs format and may describe work in progress.  Promising abstracts relevant to the scope of LOPSTR will be selected for presentation at the conference. The submission deadline for extended abstracts is May 20th, 2005.

Full papers should not exceed 16 pages (including references) in llncs format. These papers will be judged using ordinary conference quality criteria and accepted papers will have to be presented at the conference and will automatically appear in the pre-proceedings as well as in the final collection of papers, published in the LNCS series. The submission deadline for full papers is June 1st, 2005.

Accepted papers and abstracts will be collected in informal pre-proceedings which will be available at the conference.

After the conference, authors of extended abstracts describing work judged to be mature enough for publication will be invited to submit full papers.  These will be reviewed according to the usual refereeing procedures.  All accepted full papers, both those accepted for the conference and those accepted full papers based on the extended abstracts will be published in the final collection of papers which is expected to be published in the Lecture Notes in Computer Science (see http://www.springer.de/comp/lncs/) series by Springer-Verlag. Note that the full papers accepted before the conference will automatically appear in that book; there will be no additional refereeing (although authors will be given a chance to revise their papers, if they so wish).

Program Committee

• Maria Alpuente,
• Roberto Bagnara,
• Gilles Barthe,
• Annalisa Bossi,
• Giorgio Delzanno,
• Michael Hanus,
• Patricia M. Hill, (Program Chair)
• John Gallagher,
• Lindsay Groves,
• Gopal Gupta,
• Michael Leuschel,
• Fabio Martinelli,
• Fred Mesnard,
• Maurizio Proietti,
• Andreas Podelski,
• German Puebla,
• Abhik Roychoudhury,
• C.R. Ramakrishnan,
• Wim Vanhoof.
  

Important dates
---------------
   * Submission of full papers: 	 May 20, 2005 
   * Submission of extended abstracts:   June 3, 2005 
   * Notification:			 June 27, 2005
   * Camera-ready:			 July 22, 2005 
   * Conference:			 September 7-9, 2005 

Important Dates:

May 20, 2005

Submission deadline (full papers)

Submission of extended abstracts

June 27, 2005

Notification

July 22, 2005

Camera-ready version due

September 7-9, 2005

Conference

CADE is the major forum for the presentation of research in all aspects of automated deduction.

• Logics of interest include propositional, first-order, equational, higher-order, classical, intuitionistic, constructive, modal, temporal, many-valued, substructural, description, and meta-logics, logical frameworks, type theory and set theory.
• Methods of interest include saturation, resolution, tableaux, sequent calculi, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, natural deduction, proof planning, proof presentation, proof checking, and explanation.
• Applications of interest include hardware and software development, systems analysis and verification, deductive databases, functional and logic programming, computer mathematics, natural language processing, computational linguistics, robotics, planning, knowledge representation, and other areas of AI.

Paper submission: 
Submission is electronic in postscript or PDF format. Submitted papers must conform to the Springer LNCS style, preferrably using LaTeX2e and the Springer llncs class files.  Submissions can be full papers , for work on foundations, applications or implementation techniques (15 pages), as well as system descriptions (5 pages), for describing publicly available systems.  For further information and submission instructions, see the CADE-20 web page: http://sise.ttu.ee/it/cade.
 
Important dates: 
 

E-submission of title and abstract:

February 25, 2005

E-submission papers: 

March 4, 2005

Notification of acceptance:

April 22, 2005

Final version due:

May 20, 2005

Workshops and tutorials:

July 22-23, 2005

Conference:

July 24-27, 2005

      
Invited talks:
Invited talks will be given at CADE-20 by Randal Bryant (CMU), Gilles Dowek (Ecole Polytechnique) and by Frank Wolter (U. Liverpool).
 
Organizing Chair: Tanel Tammet (Tallinn TU)  
Workshop and Tutorial Chair: Frank Pfenning (CMU)  
Program Chair: Robert Nieuwenhuis (UPC Barcelona)  
Publicity Chair: Brigitte Pientka (McGill) 
 

• Paper submission deadline : March 15th, 2005
• Notification of acceptance : March 31st, 2005
• Camera-ready papers due : April 15th, 2005
• Student session : during LACL (April 28-30th, 2005)

• Philippe Blache, blache@lpl.univ-aix.fr
• Edward Stabler, stabler@ucla.edu

• Renaud Marlet, marlet@labri.fr
• Maxime Amblard, amblard@labri.fr

The 9th Congress of the Italian Association for Artificial Intelligence will be held in Milan at the University of Milano-Bicocca from 21st to 23rd of September 2005.  Due to the success of the previous editions of the AI*IA Congress, this 9th edition is intended to collect national and international contributions on research results and applications in the main fields of Artificial Intelligence, and the reviewing of the submissions will be supported by an international program committee for the first time.

Artificial Intelligence is now a growing complex set of conceptual, theoretical, methodological and technical frameworks offering innovative computational solutions in the design and development of computer-based systems. Within this perspective, researchers working in this field have to tackle a broad range of knowledge about methods, results, and solutions coming from different classical areas of this discipline. This Congress has been designed as a forum allowing researchers to present and discuss specialized results as general contributions to the AI growth.

The Congress will be structured in two main tracks: Theoretical Track and Application Track. 
For the Theoretical Track papers are welcome on Formal Models, Algorithms, Languages, and Architectures describing:

• innovative research results
• extension and improvements
• work in progress, conjectures, and preliminary results

on the main classical and new fields of AI (agents, knowledge-based systems, knowledge representation, machine learning, model-based reasoning, natural language processing, non-monotonic reasoning, robotics, speech processing, temporal reasoning, user interfaces, virtual reality, vision and pattern recognition, …).

For the Application Track papers are welcome on:

• delivered systems and experimental results
• prototypes and preliminary result analyses
• work in progress and results on feasibility analyses

applied to all traditional and new fields where AI impacts and offers innovative solutions (Arts, Automated Design, Biology, Chemistry, Engineering, Industry, Knowledge Management, Medicine, Pervasive Computing, Traffic Control, Urban Planning and Management, …).

Program Committee:

Organizing Committee:

Important Dates:

Paper submission format
Papers not exceeding 12 pages, written in English and complying with the Springer-Verlag format (www.springer.de/comp/lncs/authors.html) should be submitted electronically.  For both theoretical and application tracks, poster sessions will be organized. Extended abstracts not exceeding 4 pages can be submitted in the same format for these sessions and accepted works will be published in the proceedings.  Further information and submission instructions will be posted at the congress web page (http://AIIA2005.disco.unimib.it).

Proceedings 
The Congress proceedings will be published on the LNAI series of Springer-Verlag. Moreover, selected papers will be collected for special issues of International Journals (further information will be posted at the congress web page).

Congress Secretariat:

LPNMR'05 is the eighth in the series of international meetings on logic programming and nonmonotonic reasoning. Seven previous meetings were held in Washington, D.C. (1991), in Lisbon, Portugal (1993), in Lexington, Kentucky (1995), in Dagstuhl, Germany (1997), in El Paso, Texas (1999), in Vienna, Austria (2001), and in Fort Lauderdale, Florida (2004).
LPNMR'05 will be organized by the Department of Mathematics of University of Calabria (Italy), and will be co-located with the INFOMIX Workshop on Data Integration.
The proceedings of the conference will be published in the Springer Verlag Lecture Notes in Artificial Intelligence series, see http://www.springer.de/comp/lncs/ (to be verified).


Aims and Scope:
LPNMR is a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. The aim of the conference is to facilitate= interactions between researchers interested in the design and implementation of logic based programming languages and database systems, and researchers who work in the areas of knowledge representation and nonmonotonic reasoning.
LPNMR strives to encompass these theoretical and experimental studies that lead to the construction of practical systems for declarative programming and knowledge representation.
Authors are invited to submit papers presenting original and unpublished research on nonmonotonic aspects of logic programming and knowledge representation. We particularly encourage papers on LPNMR techniques which led to the development of significant applications.
A non-exhaustive list of topics of interest includes:

• Development and mathematical studies of logical systems with nonmonotonic entailment relations:

• Semantics of new and existing languages;
• Relationships between formalisms;
• Complexity and expressive power;
• Development of inference algorithms and search heuristics for LPNMR systems;
• Extensions of ''classical'' LPNMR languages by new logical connectives and new inference capabilities such as abduction, reasoning by cases, etc;
• Updates and other operations on LPNMR systems;
• Uncertainty in LPNMR systems.

• Implementation of LPNMR systems:
• System descriptions, comparisons, evaluations;
• LPNMR benchmarks.
• Applications of LPNMR systems:
• LPNMR languages and algorithms in planning, diagnosis, software engineering, decision making, and other domains;
• Applications of LPNMR languages in Data Integration and Exchange systems
• Methodology of representing knowledge in LPNMR languages: theory and practice;
• Integration of LPNMR systems with other computational paradigms;
• Embedded LPNMR systems: Systems using LPNMR subsystems.
  

SYSTEMS AND APPLICATIONS DEMONSTRATIONS
As part of the technical program, we also plan a special session devoted to presentations and demonstrations of implemented nonmonotonic reasoning systems. Systems and applications demonstrations track will be announced in a distinct call.

IMPORTANT DATES
Abstract Submission Deadline:	 March 22, 2005, 23:59:59 GMT
Paper Submission Deadline:	  March 25, 2005, 23:59:59 GMT
Notification (Accept/Reject):	     May 16, 2005
Conference Schedule:		     June 6, 2005
Final Conference Papers:	   June 10, 2005
Early Registration Deadline:	    July 4, 2005

SUBMISSION OF PAPERS
Papers must not exceed thirteen (13) pages including title page, references and figures, and must be formatted according to the Springer LNCS/LNAI authors' instructions. Papers must be written in English and present original research.
Paper submission is electronic via the conference home page

PROGRAM CO-CHAIRS

PROGRAM COMMITTEE

PUBLICITY CHAIR

The aim:

     The aim is, to provide a forum for researchers interested in
     the development of mathematical techniques for the analysis
     and verification of systems with infinitely many states.

Topics:

     Topics of interest include (but are not limited to):
     techniques for modeling and analysis of infinite-state systems;
     equivalence-checking and model-checking with infinite-state systems;
     parameterized systems; probabilistic and timed systems; calculi for
     mobility and security; finite-state abstractions of infinite-state
     systems; data structures for infinite state spaces.

Paper submission:

     Authors are invited to submit an extended abstract presenting recent
     (or ongoing) work in the areas relevant for the scope of INFINITY.
     Contributions should not exceed 10 pages and ENTCS format of the
     submission is highly recommended. The submissions will be evaluated
     by the programme committee and accepted papers will be published in
     the workshop proceedings. By submitting you agree that at least one
     (co-)author will register and present the paper at the workshop.

     Papers should be submitted electronically (in pdf format), by email
     to both conference co-chairs (srba@cs.aau.dk, sas@cs.sunysb.edu).
     Please, include a title, abstract, all authors and contact details
     of a single corresponding author (address, email and phone number)
     into the email as a plain text. You should receive a confirmation
     of your submission within two days. If not, then we did not receive
     your submission so resubmit, please.

Proceedings:

     Pre-proceedings of INFINITY 2005 will be available at the workshop,
     published as a BRICS Research Report of Aarhus University. Authors
     will be invited to place full papers (of at least ten pages) in
     a volume of Electronic Notes in Theoretical Computer Science series
     dedicated to workshops affiliated to CONCUR'05.

Program committee:

     Samik Basu,  Iowa State University (USA)
     Petr Jancar, Technical University of Ostrava (Czech Republic)
     Richard Mayr, North Carolina State University (USA)
     Ken McMillan, Berkeley (USA)
     Faron Moller, University of Wales Swansea (UK)
     Philippe Schnoebelen, LSV, ENS de Cachan (France)
     Scott Smolka (co-chair), Stony Brook University (USA)
     Jiri Srba (co-chair), BRICS, Aalborg University (Denmark)
     Igor Walukiewicz, Bordeaux University (France)
     Willem Visser, NASA Ames (USA)

Invited talk:

     The invited talk will be delivered by Antonin Kucera
     (Brno, Czech Republic).

Important dates:

     Submission deadline: May 20th, 2005 (Friday)
     Notification: June 17th, 2005
     Final version for pre-proceedings: June 25th, 2005
     Final version for ENTCS: September 29th, 2005

Further information:

     srba@cs.aau.dk, sas@cs.sunysb.edu
     http://www.brics.dk/infinity05/

Registration:

    The INFINITY 2005 workshop is a satellite workshop of the
    16th International Conference on Concurrency Theory (CONCUR 2005)
    (see http://www.soe.ucsc.edu/concur05/). The workshop will be
    held at the same location as CONCUR 2005, on the day immediately
    after the conference (August 27). Registration will be handled by
    the CONCUR 2005 organizing committee.

In the past, there were eight meetings in Singapore (1981), Bangkok, Thailand (1984), Bejing, China (1987), Tokyo, Japan (1990), Singapore (1993), Bejing, China (1996), Hsi-Tou, Taiwan (1999), and Chongqing, China (2002).

In 2005, the conference takes place in Novosibirsk at the Sobolev Institute of Mathematics SB RAS, August 16--19.

The purpose of the conference is to facilitate interactions between researches interested in the mathematical logic, logic in computer science, and philosophical logics. It aims at promoting activities of mathematical logic in the Asia-Pacific so that logicians both from within Asia and elsewhere would get together and exchange information and ideas.

Topics of interest include, but are not limited to, recursion theory, set theory, proof theory, model theory and universal algebra, non-classical logic, and logic in computer science.

Invited lecturers
Up to now, the following specialists in logic accepted our invitation to give a plenary lecture at the conference (in alphabetical order):
Pavel Alaev (Russia)

Deadlines
The deadline for submission of abstracts of contributed talks is February 28, 2005. Acceptance of your submission will be notified till March 31, 2005. The deadline for participants registration is April 15, 2005.

Submission and registration
The preferable way of submitting your abstract and registering is via the conference information system at

If it is not available to submit your abstract in such a way, please send it by e-mail in the PDF format to alc9@math.nsc.ru or send a hard copy to

International Programme Committee

Organising Committee

Contact information

The Software Model Checking Workshop has met two times in the past: CAV 2001 in Paris, and CAV 2003 in Boulder, Colorado.  A great deal of progress  has been made since our last meeting.  Researchers have continued to develop their own ideas and borrow others from areas such as SAT-solving, decision procedures, and abstract interpretation.  The applications have become more impressive.  Companies are beginning to develop products based on this research.

What are the new ideas?  What are the future trends?  What are the current limitations of software model checking?  These will be some of the themes at the 2005 Workshop on Software Model Checking, which will provide a forum for researchers and developers to communicate their ideas, ask questions, and learn about new approaches.

The workshop covers all aspects of software model checking and supporting techniques, ranging from verification of high-level requirements specifications to model checking of low-level bytecode programs.  Other automated verification techniques (e.g., based on static analysis or theorem proving) with the same goals are also of interest.  Theoretical results and case studies are equally welcome.

Approaches that provide limited guarantees or that work for limited classes of properties are also of interest.  We especially encourage submissions that deal with general-purpose programming languages or other languages with similar features.  Topics of interest include but are not limited to:

• Model checking for languages with features such as recursion, references, dynamic memory allocation, or object-oriented constructs.
• Static analysis and state-space reductions: slicing, partial-order reductions, symmetry reductions, etc.
• Abstraction for software model checking.
• Proving liveness properties
• Symbolic reasoning with accurate program semantics (pointers, bitvector arithmetic, etc)
• Applications of model checking to software verification/debugging.
• Advanced testing approaches, e.g., test-case generation via model checking.
• Heuristic search for model checking
• Specifications, e.g., specification patterns, specification mining.
  

Important dates

The body of each submission should not exceed 10 pages, including bibliography. The submission may include, in addition, an appendix containing technical details, which reviewers may read or not, at their discretion.  The manuscript should describe original research and contain sufficient detail to assess the merits and relevance of 
the contribution.  Simultaneous submission to other meetings with published proceedings and submission of material that has been published elsewhere are prohibited.

Submission messages should include the following information in plaintext: names and affiliations of all authors, the title of the paper, the contact author's postal and e-mail addresses and phone number, and a one- or two-paragraph abstract.  Manuscripts should be in PDF (preferred) or PostScript format.

Please submit papers via e-mail to byron@cse.ogi.edu 
The workshop proceedings will be published through Electronic Notes in Theoretical Computer Science (ENTCS).

For more information, see the SoftMC 2005: Workshop on Software Model Checking website at http://www.cse.ogi.edu/~byron/SoftMC05  .

Program Committee

Both the Formal Verification community and the Automated Reasoning community have long recognised the importance of decision procedures for the validity or the satisfiability problem of fragments of first-order logic.

In Formal Verification, many interesting and powerful decision procedures have been developed, and applied to the verification of word-level circuits, hybrid systems, pipelined microprocessors, and software. The Automated Reasoning community, on the other hand, has primarily focussed on the principles underlying the design and combination of decision procedures for different decidable theories, and on their integration into more general reasoning activities (e.g. rewriting, boolean reasoning).

Limited attention has been paid so far to the concrete issues of implementing and assessing the effectiveness of decision procedures. This state of affairs has so far prevented the exchange of architectural solutions and implementation techniques.  Furthermore, the lack of a common library of benchmarks on which to compare the performances of systems in a systematic way has so far made it difficult to compare and evaluate experimentally the merits of the different techniques.

The main goal of this workshop is to bring together researchers interested in the pragmatical aspects of decision procedures, giving them a forum for presenting and discussing implementation and evaluation techniques.

Topics of interest for the workshop include (but are not limited to):

• algorithms and data structures to implement decision procedures,
• techniques for the rapid prototyping of decision procedures,
• techniques to implement combination or incorporation schemes,
• benchmarks to evaluate and/or to compare decision procedures,
• methodologies to assess the effectiveness of decision procedures,
• the role of decision procedures in real-world verification efforts,
• techniques for promoting the re-use and the exchange of code implementing decision procedures, combination and integration schemes, and so on.

The workshop will also serve as a forum for the development of the "Satisfiability Modulo Theories Library" (SMT-LIB, URL: http://combination.cs.uiowa.edu/smtlib) initiative, that aims at establishing a library of benchmarks of practical relevance for different theories in a standardized language.
The methodology and the results of the "Satisfiability Modulo Theories Competition" (SMT-COMP) will be presented and discussed in a special session of the workshop.  The workshop will host panel discussions on the SMT-LIB and SMT-COMP initiatives.

Important Dates

Submissions
Extended abstracts addressing the pragmatical aspects of decision procedures are solicited. Submitted abstracts should not exceed 8 pages and should be written in LaTeX with the following settings: 11pt, one column, a4paper and standard margins.
Submissions should be sent by email to pdpar05@ai.dist.unige.it and contain: 

1. title, author(s) (names, correspondence addresses, e-mail addresses);
2. small abstract (< 300 words), in plain text;
3. extended abstract in postscript or PDF format, as an attachment;

Submissions will be reviewed by at least two referees. The authors of accepted submissions are expected to give a 25' presentation at the workshop.  The proceedings of PDPAR'05 will be distributed at the workshop.

Registration
Joint registration with the CAV'05 conference is possible but is not required.  Refer to the CAV'05 web site for registration instructions and deadlines.  

Program Committee

More Information
See http://www.ai.dist.unige.it/pdpar05 for PDPAR'05, and http://www.cav2005.inf.ed.ac.uk/ for CAV'05.

The third edition of the LCMAS workshop series aims at bringing together researchers interested in topics related to the use of formal tools when applied to modelling, specifying, verifying, and reasoning about multi-agent systems in which communication and updating play a crucial role. Specifically, the workshop aims at providing a forum for discussing technical issues arising in the use of formalisms (epistemic, temporal, dynamic and authentication logics, and related techniques) inspired by the needs of modelling information exchanges in multi-agent systems. The workshop will be held as a satellite workshop of IJCAI05, the 19th edition of the biannual international joint conference on Artificial Intelligence. Previous editions of the workshop were held in Eindhoven in 2003 (as satellite workshop of ICALP), and in Nancy in 2004 (as satellite workshop of ESSLLI). Papers from the workshops were published in both occasions in the ENTCS series.
 

WORKSHOP SPECIFIC THEMES
Particular focus of attention will be given to papers relating to the following specific themes:

• Communication protocols: Semantics for communications processes in multi-agent systems. Formal dependencies between communication protocols and intensional (e.g., epistemic) properties of the agents. Use of process languages for modelling communication in MAS.
• Security, authorisation, and trust: Logics (BAN logic, deontic logic, etc.) for security and authorisation, where the assumption that the other agents in the network are cooperative, or at least not hostile, is dropped. Semantics for authorisation logics, and languages for their description. Logics for modelling policies and trust in MAS and related issues.
• Semantics of speech acts: Logical semantics of speech acts and institutional communication. Semantics of agent communication languages and their relationship to speech acts. Logics for planning speech acts. Relationships between speech act theory, belief revision and epistemic updates.
• Verification of communication protocols: theorem proving and model checking in all its variants as well as AI-based techniques. Case studies, tailoring of general tools and specific tools related to MAS.
• Dynamics of epistemic positions: Combinations of epistemic logic and temporal logic (and related semantical issues) resulting from communicative acts, such as message passing, broadcasting, etc. Modelling of epistemic updates, and refinements following communicative acts. 

FORMAT/FEES
The workshop will be held either on the 30th of July or on the 1st of August (date to be confirmed). No IJCAI conference fees will be required to participate to the workshop, but a small attendance fee will be levied. Details of this will be posted as they become available.
 

PUBLICATION DETAILS
The proceedings of the workshop will be published by IJCAI and made available to all workshop participants. Papers from the 2003 and 2004 editions of the workshop were published in volumes of the ENTCS series. Publications of the proceedings of this year's edition as a volume of the ENTCS are under arrangement. Moreover, consideration will be given for a further special issue for extended versions of a selected number of contributions in an international journal.
 

SUBMISSION
Authors are invited to send original research papers in ps or pdf format by 30 March 2005 by email to evink(at)win.tue.nl. The paper should not exceed 15 pages, preferably formatted in plain LaTeX article style, or alternative similar formats.
 

IMPORTANT DATES

• 30 March, 2005: Submission deadline
• 30 April, 2005: Notification of acceptance
• 20 May, 2005: Final version due
• 31 July or 1 August, 2005: Workshop

ORGANIZERS

Wiebe van der Hoek (Liverpool)

Alessio Lomuscio (King's College London)

Erik de Vink (Eindhoven)

Mike Wooldridge (Liverpool)

THE EVENT
LAAIC 2005 is the first international workshop on Logical Aspects and Applications of Integrity Constraints. The workshop will be held in Copenhagen, Denmark, 26 August 2005, and is co-located with the 16th International Conference on Database and Expert Systems Applications, DEXA 2005 (http://www.dexa.org), 22-26 August 2005.

SCOPE
Major themes for the workshop include theory and applications of integrity constraints to the following topics:

• Active Databases
• Data Integration under Integrity Constraints
• Data Mining
• Integrity Checking and Maintenance
• Integrity Constraints in SQL
• Program Transformations
• Semantic Query Optimization
• Transactions and Concurrency
• Update Propagation
• XML and Semi-structured Data

INVITED SPEAKERS

SUBMISSION
Authors are invited to submit research contributions representing original, previously unpublished work. Papers should be in English, and should not exceed 5 pages, formatted according to the IEEE double-column proceedings format. Submitted papers will be carefully evaluated based on originality, significance, technical soundness, and clarity of expression.

Papers accepted by the Programme Committee must be presented at the workshop by one of the authors and will be published by IEEE in a proceedings volume of the DEXA 2005 workshops.

The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than 200 words, and a list of keywords. Papers should be submitted in pdf or ps format to the email address laaic05@ruc.dk by March 4, 2005.

IMPORTANT DATES

PROGRAM COMMITTEE

Static Analysis is increasingly  recognized as a fundamental  tool for high performance  implementations   and  verification  of  programming languages and systems. The  series   of Static Analysis Symposia   has served   as the  primary   venue   for presentation of    theoretical, practical, and   application   advances in  the  area.  The   twelfth International  Static Analysis Symposium    (SAS'05) will be  held  in London, co-located with  LOPSTR 2005 - The International  Symposium on  Logic-based Program Synthesis and  Transformation.   Previous symposia were  held in Verona, San Diego, Madrid, Paris, Santa Barbara, Venice, Pisa, Paris, Aachen, Glasgow and Namur.

The technical program  for  SAS'05 will  consist of invited  lectures, tutorials,  panels, presentations  of   refereed papers, and  software demonstrations.  Contributions are welcome   on all aspects  of Static Analysis, including, but not limited to:

abstract domains,                             abstract interpretation,
abstract testing,                                 complexity analysis,
data flow analysis,                                    model checking,
optimizing compilers,                          program specialization,
security analysis,                             theoretical frameworks,
type inference,                                  verification systems.

Submissions    can    address any   programming   paradigm,  including concurrent,   constraint,     functional,   imperative,    logic   and object-oriented programming. Survey papers, that present some aspect of the above topics with a new coherence, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings.

Submitted papers should be at most 15 pages formatted in LNCS style (excluding bibliography and well-marked appendices). Program committee members  are not required to read the  appendices, and thus papers should  be intelligible without them.  The  proceedings will  be published by Springer-Verlag  in the Lecture Notes in Computer Science series (see http://www.springer.de/comp/lncs/authors.html for the LNCS author instructions). Thus, adhering to that style already in the submission is strongly encouraged.  Papers should be submitted either in PostScript or PDF   format  and  they   should   be  interpretable  by Ghostscript or  Acrobat Reader.

*Important dates:*

*Program Committee:*

*Contact address:*

Background
Verification  techniques,   such   as  model  checking,  and  planning techniques have  many  commonalities.  Planning  and  scheduling (P&S) systems    are     finding increased    application     in safety- and mission-critical systems that  require   a high level   of  assurance. However tools and methodologies for  verification and validation (V&V) of P&S systems have received relatively little  attention. The goal of this workshop is to initiate an ongoing interaction between the P&S and V&V communities, specifically here to  identify   specialized and innovative V&V  tools and methodologies that can be applied to P&S.

Model-based P&S systems have unique architectural features that give rise to new V&V challenges. Most significantly, these systems consist of a planner engine that is largely stable across applications and a declaratively-specified domain model specialized to a particular application. Planners use heuristic search to compute detailed plans that achieve high level objectives stated as an input goal set. Experience has shown that most errors are in domain models, which can be inconsistent, incomplete or inaccurate models of the target domains. There are currently few tools to support the model construction process itself, and even fewer that can be used to validate the structures of the domains once they are constructed.

While heuristic search has proven effective at finding plans, it is generally demonstrated only empirically that a given heuristic strategy is effective in the domains on which it is tried. As planners find wider application and problems to which they are applied become more adventurous, a second challenge to V&V in P&S systems is to demonstrate that specific heuristic strategies have reliable and predictable behaviors over their operational profile, including identification of resource constraints in both the plan generation and in the quality of the plans produced. 

Organization
In this first workshop, of what it is hoped will become a series of exchanges between the V&V and P&S communities, we propose to focus on the validation and verification of domain models. To facilitate contributions on this topic we make available (on the workshop website) a test bed consisting of a small collection of domain models. Domains expressed in the standard planning domain description language PDDL are supplied, together with an account of the semantics of PDDL, a parser and plan validation tool for PDDL. A planner and English requirements will also be supplied. Both formal and informal V&V methods are of interest. 

The workshop will be organized over two days. The first day will be devoted to presentations of relevant papers, particularly emphasizing work that attempts to cross the gap between V&V and P&S or proposed approaches to achieving a greater integration of V&V in P&S. To encourage dialogue and exchange commentaries will be solicited on all papers that are selected for presentation and presented alongside the primary contributions. The second day will include an attempt to make practical and concrete headway in the application of V&V techniques in P&S, in round-table discussions and working groups. 

Important Note: the workshop will have the atmosphere of a working group, where the emphasis is on participation, discussion and exchange of new ideas and not just on closed form papers (although such are very welcome). This is in consideration of the novelty of the field, where we encourage new initial ideas and work in process.

Topics of interest include:

Submission and publication:
There are two types of submissions: short position statements and regular papers. Position papers are a maximum of two pages. Regular papers are a maximum of 12 pages. Papers should be submitted to icaps05-vvworkshop@email.arc.nasa.gov  and should follow the format indicated on the website. Papers will be printed as a hard-copy hand-out, and workshop findings and a workshop report will be published on the workshop website.

Important Dates:

Program Committee: 

Chairs: 

• Applications and domain-specific languages: Systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems and web programming, XML processing, security.
• Foundations: Formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects.
• Design: Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming.
• Implementation: Abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources.
• Transformation and analysis: Abstract interpretation, partial evaluation, program transformation.
• Software-development techniques for functional programming: Design patterns, specification, verification, validation, debugging, test generation, tracing and profiling.
• Practice and experience: Functional programming in education and industry.
• Functional pearls: Elegant, instructive examples of functional programming.

Papers in the last three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem.

A special issue of the Journal of Functional Programming will highlight selected papers from the meeting.

Submission instructions will be available by 1 March, 2005, on this page.

Important Dates:

Organizers:

Introduction

Constraint Programming (CP) is a powerful technology to solve combinatorial problems which are ubiquitous in academia and industry. The last ten years have witnessed significant research devoted to modelling and solving problems with constraints. CP is now a mature field and has been successfully used for tackling a wide range of real-life complex applications.

As constraint solving is intractable in general, problems can become difficult to solve as their size increase. Therefore, there is always a need for more efficient solvers to cope with ever difficult problems. Techniques such as the design of specialised filtering algorithms for recurring constraints, sophisticated search techniques, heuristics to guide the search, symmetry breaking have significant impact on the time spent to solve problems. Efficiency can be improved also by bridging the gap between CP and the other communities such as Operations Research, Local Search, SAT, Planning, and Machine Learning.

Formulating an effective model for a given problem often requires trying alternate models and using ``modelling tricks'' such as redundant modelling and channelling. This could be a challenge even for modelling experts. The increasing use of CP necessitates higher level modelling languages to facilitate the exploitation of the available technology and to make CP reachable to a wider user base. The hope is that the next generation modelling languages will assist modellers by for instance helping acquire and validate constraints, automatically generating alternate models and selecting the most appropriate one for the application in hand, and synthesising propagators for complex constraints.

It is desirable to extend the classical framework for modelling and solving with constraints to adapt to some real-life scenarios. For instance, many problems contain uncertainty and thus the user may require robust solutions. In some cases, problems are over-constrained and the user has preferences for which constraints to relax. Explanations can be necessary to understand the solution process. Real-life problems are often optimisation problems and the users might want to improve the quality of their solutions as quickly as possible.

Workshop

Workshop topics include (but are not limited to):

• filtering algorithms
• synthesising propagators
• symmetry and constraints
• search algorithms and heuristics
• local and hybrid search
• modelling
• constraint acquisition and validation
• model generation and selection
• preferences
• optimization and over-constrained problems
• uncertainty and robustness
• explanations
• real-life applications

In addition to technical presentations based on accepted papers, an invited talk and a modelling challenge are planned. The details of the modelling challenge will be available shortly.

This workshop is the fifth in the series, following the successful earlier workshops held alongside ECAI 2000, IJCAI 2001, ECAI 2002, and ECAI 2004. There have also been related workshops at CP 2001/2002/2003/2004, IJCAI 1999/2003 and ECAI 1998.

The full text for call for papers can be found here .

Participation

To encourage participation, organisers ask for standard contributions including research results on the workshop topics, as well as submissions posting challenging problems to be discussed at the workshop. At least one author of each submission accepted for presentation must attend the workshop and present the contribution.

The workshop is open to all members of the AI community. Attendance is limited to active participants only. Workshop attendees need not register for the main IJCAI conference.

Submission and Selection

To submit a paper to the workshop, please e-mail to comic@4c.ucc.ie a PS or PDF file in IJCAI conference style (http://ijcai05.csd.abdn.ac.uk/index.php?section=papers#format).

Papers should not exceed 8 pages. All submissions must be received by April 23, 2005. The organising committee will acknowledge all submissions. If a submitted paper is not acknowledged in 2 working days, the authors are kindly asked to contact the chair.

All submissions will be reviewed and those that present a significant contribution to the workshop topics will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at the workshop page and in hard copy on the day of the workshop.

Important Dates

• Paper submission deadline: April 23, 2005
• Notification of authors: May 22, 2005
• Camera ready version deadline: May 29, 2005
• Registration deadline: xx yy 2005

Organization

Organizing Committee:

• Zeynep Kiziltan (Chair), Università di Bologna, Italy
• Christian Bessiere, LIRMM-CNRS, France
• Brahim Hnich, 4C, University College Cork, Ireland
• Toby Walsh, University of New South Wales, Australia

Modelling Challenge Organisers:

• Ian Gent, University of St. Andrews, U.K.
• Barbara Smith, 4C, University College Cork, Ireland

Programme Committee:

• Claire Bagley, Oracle Corporation, U.S.A.
• Roman Bartak, Charles University, Czech Republic
• Nicolas Beldiceanu, Ecole des Mines de Nantes, France
• Carmen Gervet, IC-Parc, Imperial College London, U.K.
• Esther Gelle, ABB Switzerland Corporate Research, Switzerland
• Warwick Harvey, IC-Parc, Imperial College London, U.K.
• Jimmy Lee, The Chinese University of Hong Kong, Hong Kong
• Pedro Meseguer, IIIA-CSIC, Spain
• Michela Milano, Università di Bologna, Italy
• Wim Nuijten, ILOG, The Netherlands
• Patrick Prosser, Glasgow University, U.K.
• Jean-Francois Puget, ILOG, France
• Jean-Charles Regin, ILOG, France
• Thomas Schiex, Institut National de La Recherche Agronomique, France
• Peter Stuckey, University of Melbourne, Australia
• Edward Tsang, University of Essex, U.K.
• Mark Wallace, Monash University, Australia

IMPORTANT DATES 

GENERAL INFORMATION

  This conference is a continuation of international meetings on
  Automated Reasoning with Analytic Tableaux and Related Methods held
  1992 in Lautenbach (Germany), 1993 in Marseille (France), 1994 in
  Abingdon (UK), 1995 in St. Goar (Germany), 1996 in Terrasini
  (Italy), 1997 in Pont-à-Mousson (France), 1998 in Oisterwijk
  (Netherlands), 1999 in Saratoga Springs (USA), 2000 in St Andrews
  (Scotland), 2002 in Copenhagen (Denmark), and 2003 in Rome
  (Italy). In 2001 TABLEAUX was part of IJCAR 2001 in Siena, and in
  2004 it was part of IJCAR 2004 in Cork (Ireland).

  In September 2005, the conference will be held in Koblenz, Germany.
  The proceedings will again be published in Springer's LNAI series.

  See http://tableaux2005.uni-koblenz.de for more information on
  TABLEAUX 2005, and http://i12www.ira.uka.de/TABLEAUX for information
  about the TABLEAUX conference series.

  The International Workshop on First-Order Theorem Proving (FTP 2005)
  will also be held in Koblenz at the same time, with opportunities
  for joint registration.


TOPICS

  Tableau methods are a convenient formalism for automating deduction
  in various non-standard logics as well as in classical logic. Areas
  of application include verification of software and computer
  systems, deductive databases, knowledge representation and its
  required inference engines, and system diagnosis. The conference
  brings together researchers interested in all aspects - theoretical
  foundations, implementation techniques, systems development and
  applications - of the mechanization of reasoning with tableaux and
  related methods.

  Topics of interest include (but are not restricted to):

    * analytic tableaux for various logics (theory and applications)
    * related techniques and concepts, e.g., model checking and BDDs
    * related methods (model elimination, sequent calculi, 
      connection method, ...)
    * new calculi and methods for theorem proving in classical and 
      non-classical logics (modal, description, intuitionistic, linear, 
      temporal, ...)
    * systems, tools, implementations and applications.

  TABLEAUX 2005 puts a special emphasis on applications. Papers
  describing applications of tableaux and related methods in areas
  such as, for example, hardware and software verification, knowledge
  engineering, semantic web, etc. are particularly invited.

  One or more tutorials will be part of the conference program.


SUBMISSIONS

  The conference will include contributed papers, tutorials, system
  descriptions, position papers and invited lectures. Submissions are
  invited in four categories:

    A  Research papers (reporting original theoretical and/or experimental 
                        research, up to 15 pages)
    B  System descriptions (up to 5 pages)
    C  Position papers and brief reports on work in progress
    D  Tutorials in all areas of analytic tableaux and related methods 
       from academic research to applications (proposals up to 5 pages)

  Submissions in categories A and B will be reviewed by peers,
  typically members of the program committee. They must be
  unpublished and not submitted for publication elsewhere. Accepted
  papers in these categories will be published in the conference
  proceedings (within the LNAI series of Springer), which will be
  available at the conference. For category {\bf B} submissions a working
  implementation must exist and be available to the referees.

  Submissions in category C will be reviewed by members of the
  program committee and a collection of the accepted papers in this
  category will be published as a Technical Report of the Department
  of Computer Science, University of Koblenz.  

  Tutorial submissions (Category D) may be at introductory,
  intermediate, or advanced levels. Novel topics and topics of broad
  interest are preferred. The submission should include the title, the
  author, the topic of the tutorial, its level, its relevance to
  conference topics, and a description of the interest and the
  scientific contents of the proposed tutorial. Tutorial proposals
  will be reviewed by members of the program committee.

  Authors of accepted papers are expected to present their work at the
  conference.

  Further information and instructions about submissions can be found
  on the conference website at tableaux2005.uni-koblenz.de.


PROGRAM COMMITTEE
  
  Bernhard Beckert, U. of Koblenz, Germany (Chair)
  Peter Baumgartner, MPI Saarbruecken, Germany
  Marta Cialdea Mayer, U. Roma Tre, Italy
  Roy Dyckhoff, U. of St. Andrews, Scotland
  Christian Fermueller, Technical U. of Vienna, Austria
  Ulrich Furbach, U. of Koblenz, Germany
  Didier Galmiche, LORIA, U. Henri Poincare, France
  Martin Giese, Chalmers U., Gothenburg, Sweden
  Rajeev P. Gorè, Australian National U., Canberra, Australia
  Jean Goubault-Larrecq, École Normale Supérieure de Cachan, France
  Reiner Haehnle, Chalmers U., Gothenburg, Sweden
  Ian Horrocks, U. of Manchester, UK
  Ullrich Hustadt, U. of Liverpool, UK
  Christoph Kreitz, U. of Potsdam, Germany
  Reinhold Letz, Technical U. of Munich, Germany
  Maarten Marx, U. of Amsterdam, The Netherlands
  Ugo Moscato, U. of Milano-Bicocca, Italy
  Neil V. Murray, U. at Albany, USA
  Ilkka Niemela, Helsinki U. of Technology, Finland
  Lawrence Paulson, U. of Cambridge, UK
  David A. Plaisted, U. of North Carolina, USA
  Peter H. Schmitt, U. of Karlsruhe, Germany
  Viorica Sofronie-Stokkermans, MPI Saarbruecken, Germany
  Arild Waaler, U. of Oslo, Norway
  Calogero G. Zarba, LORIA and INRIA-Lorraine, France


ORGANIZING COMMITTEE
  
  Conference Chair:
  Bernhard Beckert, University of Koblenz, Germany
  
  Publicity Chair:
  Gernot Stenz, Technical U. of Munich, Germany
  
  Local Organizers:
  Gerd Beuster
  Vladimir Klebanov
  Thomas Kleeman
  Alex Sinner
  Christoph Wernhard 

Multi-Agent Systems are communities of problem-solving entities that can perceive and act upon their environments to achieve their individual goals as well as joint goals. The work on such systems integrates many technologies and concepts in artificial intelligence and other areas of computing as well as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability a full spectrum of domains, from search engines to aids to electronic commerce and trade, e-procurement, recommendation systems, simulation and routing, to cite only some.

Although commonly implemented by means of imperative languages, mainly for reasons of efficiency, agent-related concepts have recently increased their influence in the research and development of Computational Logic based systems.

Computational Logic provides a well-defined, general, and rigorous framework for studying syntax, semantics and procedures for various tasks by individual agents, as well as interaction amongst agents in multi-agent systems, for attending implementations, environments, tools, and standards, and for linking together specification and verification of properties of individual agents and multi-agent systems.

The purpose of this workshop is to discuss techniques, based on Computational Logic, for representing, programming and reasoning about Agents and Multi-Agent Systems in a formal way.

The workshop focuses on improving the memory system performance of general-purpose programs. Architecture, programming, and application trends have made memory performance a critical issue in the speed and efficiency of computer systems. The workshop is multi-disciplinary and fosters collaboration among researchers in a range of fields including compilers, memory management, programming languages, architecture, operating systems, performance evaluation, and database systems.

Papers are solicited on all aspects of memory system performance. These include, but are not limited to:

• Analysis of memory systems performance (including power, bandwidth, and latency)
• Techniques for characterizing the memory behavior of programs
• Static and dynamic techniques for understanding and improving memory performance
• Memory hierarchy optimizations
• Prefetching and compression to improve memory system performance
• Code/data/page placement to eliminate page faults and cache misses
• Moving computation to data
• Managed memory and garbage collection optimizations
• Improving the timing predictability of memory systems
• Improving memory system performance in constrained devices
• Impact of new storage technology (e.g., MRAM)
• Using performance monitoring hardware to guide memory optimizations

Software, hardware and hybrid approaches are encouraged.  In addition, we solicit papers from practitioners describing problems and experience with memory performance in specific application domains.

Submission Guidelines

Full paper submissions should not exceed 10 pages in length and should be submitted electronically through the web site available from the workshop home page (see below). Copies of accepted papers will be made available at the workshop and through the ACM digital library. Submitted papers must not be simultaneously under review for any other conference or journal, and authors should point out any substantial overlap with their previously published or currently submitted work.

• Full paper due: Friday February 25, 2005, at 11:59:59 PM Pacific time (firm deadline)
• Notification: approximately Friday April 8, 2005
• Final paper: approximately Friday May 27, 2005

• automated debugging      
• declarative debugging
• type debugging           
• knowledge-based debugging
• algorithmic debugging    
• assertion-based debugging
• trace analysis           
• software testing
• program slicing          
• monitoring
• performance debugging    
• parallel and distributed debugging
• debugging by simulation  
• debugging using record/replay

• April 1 (abstracts)
  
• April 8, 2005 (papers)

• Rajeev Alur (U. Penn),
  
• Dawson Engler (Stanford),
• David Wagner (Berkeley). <>

• <>Modex/Feaver (Gerard Holzmann and Theo Ruys),
• BLAST (Tom Henzinger, Ranjit Jhala and Rupak Majumdar),
• Java PathFinder (Willem Visser).

• George Avrunin (U. Mass),
• Dennis Dams (Bell Labs),
• Stefan Edelkamp (U. Dortmund),
• Cormac Flanagan (UC Santa Cruz)
• Jaco Geldenhuys (Tampere U.),
• Patrice Godefroid (Bell Labs; chair),
• Susanne Graf (Verimag),
• Gerard Holzmann (NASA JPL),
• Sarfraz Khurshid (UT Austin),
• Stefan Leue (U. Konstanz),
• Rupak Majumdar (UCLA),
• Laurent Mounier (Verimag),
• Shaz Qadeer (Microsoft),
• Theo Ruys (U. Twente),
• Willem Visser, (NASA Ames),
• Pierre Wolper (U. Liege).

Overview
Functional and declarative programming plays an important role in computing education at all levels. The aim of this workshop is to bring together educators and others who are interested in exchanging ideas on how to use a functional or declarative programming style in the classroom.

Scope
The workshop will cover a wide spectrum of functional and declarative programming techniques:

• programming courses using traditional functional and declarative programming languages (Haskell, Mathematica, ML, Prolog, Scheme, ...);
• programming courses teaching functional programming in commercial languages (e.g. C, C++, or Common LISP);
• programming courses teaching functional program design in modern OO languages like Java, C#, or Eiffel;
• pedagogic programming environments to support functional and declarative programming;
• teaching tools implemented with functional and declarative languages;
• declarative programming language extensions and implementations with pedagogical relevance;
• application courses that benefit heavily from functional and declarative programming (e.g. theorem proving or hardware design).

 Furthermore, the workshop will also cover all levels of education: secondary school; college and university; post-college and continuing professional education.

Submissions
Submissions will be sought in two forms:

• 30 minute papers, to be reviewed by the workshop organisers and to be published in the proceedings.
• 10 minute slots for `tips and tricks': these will be made available through the workshop web site.

Submissions will be refereed by the workshop organisers who will call upon other members of the functional/declarative programming community for expert advice.
Participants who choose to deliver a standard presentation are asked to submit a draft PDF paper of five pages; presenters of short talks are asked to submit an abstract of 250 words. These should be submitted by June 4, 2005. Comments from the organizers and notice of acceptance will be sent to authors by July 15, 2005.

Proceedings will be published by SIGPLAN. Details of the publication procedure will be given on the workshop web site in due course.

Organisers

 FDPE05: http://www.cs.kent.ac.uk/~sjt/fdpe05/
 ICFP05: http://www.brics.dk/~danvy/icfp05/

BACKGROUND

In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, and automated reasoning, there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. In order to be usable in practice, these specialized systems must be combined with each other, and they must be integrated into general purpose systems. The development of general techniques and methods for the combination and integration of special formally defined systems, as well as for the analysis and modularization of complex systems has been initiated in many areas. The International Workshop on Frontiers of Combining Systems (FroCoS) traditionally focuses on this type of research questions and activities and aims at promoting progress in the field.

The previous FroCoS workshops were held in Munich (1996), Amsterdam (1998), Nancy (2000) and Santa Margherita Ligure (2002). In 2004, FroCoS joined IJCAR 2004, the 2nd International Joint Conference on Automated Reasoning. Like its predecessors, FroCoS 2005 wants to offer a common forum for research activities in the general area of combination, modularization and integration of systems (with emphasis on logic-based ones), and of their practical use.

TOPICS

Typical topics of interest include (but are not limited to):

• combination of logics (e.g., modal logics, logics in AI, ...);
• combination of decision procedures, of satisfiability procedures, and of constraint solving techniques (e.g. unification and matching algorithms, general symbolic constraints, numerical constraints);
• combinations and modularity in term rewriting;
• integration of equational and other theories into deductive systems (e.g. theory resolution, constraint resolution, constraint paramodulation, ...);
• combination of deduction systems and computer algebra;
• integration of data structures (e.g., sets, multisets, lists) into CLP formalisms and deduction processes;
• model/problem analysis and decomposition (e.g. isolating tractable or loosely connected sub-problems, global constraints design, etc.)
• hybrid methods for deduction, resolution and constraint propagation (e.g., combinations of local and global, complete and propagation techniques)
• hybrid systems in computational linguistics, knowledge representation, natural language semantics, and human computer interaction;
• logical modelling of multi-agent systems;
• logical aspects of combining and modularizing programs and specifications.

INVITED TALKS

t.b.a.

SUBMISSIONS

The programme committee seeks high-quality submissions that are original and not submitted for publication elsewhere. Submission is electronic in postscript or PDF format. Submitted papers must conform to the Springer LNCS style, preferably using LaTeX2e and the Springer llncs class files. Submission categories include full papers, for work on foundations, applications, implementation techniques, and problem sets (up to 15 pages), as well as system descriptions (up to 8 pages), for describing publicly available systems. The submission deadline is May 2, 2005 for titles and abstracts, and May 9, 2005 for papers. For further information and submission instructions see the FroCoS 2005 web page: http://www.logic.at/frocos05/.

PROCEEDINGS

Accepted papers will appear in the proceedings of the conference, published as a volume of the Lecture Notes in Artificial Intelligence (LNAI) series, Springer-Verlag. Proceedings will be available at the time of the conference.

IMPORTANT DATES

 May     2, 2005: Deadline for electronic submission of abstract
 May     9, 2005: Deadline for electronic submission of papers
 June   20, 2005: Notification of acceptance/rejection
 Jul    11, 2005: Deadline for final versions of accepted papers
 Sep 19-21, 2005: Conference

PROGRAM COMMITTEE

 * Alessandro Armando	      (U Genova)
 * Franz Baader               (TU Dresden)
 * Clark W. Barrett           (NYU New York)
 * Frédéric Benhamou 	      (LINA, U Nantes)
 * Michel Bidoit              (LSV, CNRS & ENS Cachan)
 * Jacques Calmet             (U Karlsruhe)
 * Jürgen Giesl               (RWTH Aachen)
 * Bernhard Gramlich (chair)  (TU Wien)
 * Deepak Kapur               (UNM Albuquerque)
 * Maarten Marx               (U Amsterdam)
 * Joachim Niehren	      (INRIA Futurs, U Lille)
 * Christophe Ringeissen      (LORIA-INRIA Nancy)
 * Manfred Schmidt-Schauss    (U Frankfurt)
 * Cesare Tinelli             (U Iowa)
 * Ashish Tiwari              (SRI Menlo Park)
 * Frank Wolter               (U Liverpool)

 * Aneta Binder
 * Bernhard Gramlich
 * Franziska Gusel
 * Gernot Salzer
 * Jana Srna

 Bernhard Gramlich
 TU Wien, Fakultät für Informatik, Theory and Logic Group
 Favoritenstr. 9 - E185/2, A-1040 Wien, Austria
 Email: gramlich@logic.at

FURTHER INFORMATION

 FroCoS 2005 web page: http://www.logic.at/frocos05/

OVERVIEW
SARA'2005 is an Artificial Intelligence symposium on all aspects of abstraction, reformulation, and approximation. Like past SARAs, it will consist of stimulating technical presentations spanning the traditional boundaries that fragment Artificial Intelligence research.

Attendance is limited to approximately 50 participants. Graduate students whose research involves techniques of abstraction, reformulation or approximation are highly encouraged to attend, and some funding might be available to subsidize their costs.

SARA'2005 will take place from July 26th to July 29th, prior to IJCAI-2005. SARA will be located in a wonderful location: Radisson SAS Airth Castle & Hotel, in Stirlingshire, nearby Edinburgh (Scotland's capital city, one of the greenest and architecturally most beautiful cities in Northern Europe).

The considerable interest in AR&A techniques has led to a series of successful symposia over the last decade. AAAI workshops in 1990 and 1992 focused on selecting, constructing and using abstractions and approximations, while a series of workshops in 1988, 1990, and 1992 focused on problem reformulations. The two workshop series were then combined since there was considerable overlap in their attendees and topics. The present symposium is the sixth in this new series, following successful symposia in 1994, 1995, 1998, 2000 and 2002. Its aim is to provide a forum for intensive interaction among researchers in all areas of artificial intelligence with an interest in the different aspects of AR&A techniques. The diverse backgrounds of participants of previous symposia has lead to a rich and lively exchange of ideas, allowed the comparison of goals, techniques and paradigms, and helped identify important research issues and engineering hurdles. We expect that the upcoming symposium will include an equally diverse group of participants.

Anyone who has a paper or extended abstract accepted (see below) will be invited to attend. Anyone else who is interested in attending must apply by sending a research summary (one or two pages), including a list of relevant publications, to the program co-chairs before April 17, 2005. Invitations will be extended to as many interested people as possible. The research summaries of the invited non-presenters will be published in the proceedings.

Invitations will be sent April 24 2005 along with registration information.

• New techniques for automatically constructing and selecting appropriate AR&A.
• Methods for selecting which of several applicable AR&A techniques is best for a given problem.
• Frameworks that unify and classify AR&A techniques.
• Empirical and theoretical studies of the costs and benefits of AR&A.
• Applications of AR&A to
  • search, constraint satisfaction, deterministic and probabilistic planning, theorem proving, logic programming, game playing , distributed data and knowledge bases, internet search and navigation, knowledge compilation, knowledge acquisition, knowledge reformulation, simulation, design, diagnosis and control of physical systems (including mobile robots), automatic programming, analogical reasoning, case-based reasoning, reasoning under uncertainty, reinforcement learning, machine learning, speed-up learning.
• Fielded applications demonstrating the benefits of AR&A.

Researchers who wish to make presentations at the symposium should submit a full paper or, if they prefer, an extended abstract. Authors of accepted extended abstracts are encouraged to produce full papers by the deadline for camera-ready copies. Researchers who wish to attend the symposium without making a presentation must submit a research summary as described above.

The submissions and final versions of all papers and summaries must be in LNCS/LNAI format. Formatting instructions can be found at www.springer.de/comp/lncs/authors.html. Full papers should not exceed 15 pages, extended abstracts should not exceed 8 pages, and research summaries should not exceed 2 pages.

Full paper submissions must report on substantial, original, and previously unpublished research. SARA allows researchers to submit 1- or 2-page abstracts on research that will be submitted to, has been submitted to, or has already been published in archival conferences or journals. However, researchers are encouraged to submit full papers, if possible.

Papers have to be submitted electronically in PDF format to the following email address:

Please include several ways of contacting the principal author, including e-mail address, telephone number, and fax number. Accepted full papers need to be presented at the symposium. In case of multiple authors, please indicate which authors will participate in the symposium.

Additional information may be obtained from the symposium home page on the World Wide Web:

IMPORTANT DATES

Deadline for submitting a full paper or extended abstract: Friday February 25, 2005
(authors are requested to send a notification of intent to submit, together with a draft title and short abstract,
by February 20, 2005 to sara_submission@limbio-paris13.org )

Notification of acceptance of full papers and extended abstracts: Sunday April 10, 2005

Deadline for submitting a research summary: April 17, 2005

Invitations to attend SARA will be sent out: Monday April 25, 2005

Deadline for camera-ready copies: Sunday May 8, 2005.

The Ninth Italian Conference on Theoretical Computer Science will take place at the Certosa di Pontignano (Siena), Italy. Papers presenting original contributions in any area of theoretical computer science are being sought. Topics include (but are not limited to):

• analysis and design of algorithms,
• computability,
• computational complexity,
• cryptography,
• formal languages and automata,
• foundations of programming languages and program analysis,
• foundations of artificial intelligence and knowledge representation,
• foundations of web programming
• natural computing paradigms (quantum computing, bioinformatics),
• parallel and distributed computation,
• program specification and verification,
• term rewriting,
• theory of concurrency,
• theory of data bases,
• theory of logical design and layout,
• type theory,
• security,
• symbolic and algebraic computation,

Program Committee:

Organizing Committee:

Invited Speakers:

Dates and Deadlines:

Submissions:
Authors are invited to submit electronically one copy of their draft paper, not exceeding fifteen pages. The paper should clearly indicate the results achieved, their significance, and their relation to other work in the area.  Extended proofs can be placed in a clearly marked appendix. It is planned to publish the proceedings in the Springer Lecture Notes in Computer Science series. To uniform the submissions the authors are encouraged to use Latex and the Springer LNCS style (www.springer.de/comp/lncs)

The web-based submission form is available at the page http://ictcs05.dsmi.unisi.it/submission.html. In case electronic submission is not possible, the authors should contact:

Conference Page:
This Call For Papers is available online at the conference web page http://ictcs05.dsmi.unisi.it

Registration Details:
The registration form will be reachable from the conference web page. A limited number of grants for students and young researchers covering the registration fees are available. Details for the applications are in the conference web page.

AAAI-05 is the Twentieth National Conference on Artificial Intelligence (AI). The purpose of this conference is to promote research in AI and scientific interchange among AI researchers, practitioners, and scientists and engineers in related disciplines. AAAI-05 will have multiple technical tracks, poster sessions, invited speakers, and exhibit programs, all selected according to the highest reviewing standards.

The conference provides a forum for a broad range of topics, including (but not limited to) knowledge representation, machine learning, autonomous agents, planning, machine perception, robotics, expert systems, theorem proving, common- sense reasoning, probabilistic inference, constraint satisfaction, game playing, automated diagnosis, data mining, natural language processing, neural networks, reinforcement learning, semantic web, information integration and cognitive modeling.

As the national conference for all of AI, AAAI encourages the presentation of results both from core AI technical areas and from efforts to synthesize and unify approaches to the problems faced by intelligent systems. Contributions involving the role of AI techniques and systems in other emerging areas of computer science, science, and society (such as the Web, grid computing, biotechnology, health care, and sensory networks in physical environments, to name just a few) are particularly encouraged.

In addition to normal technical papers, this year, we also specifically encourage vision/challenge papers that lay out near-term directions for particular subfields of AI.

TIMETABLE FOR AUTHORS

• January 14, 2005 to March 18, 2005: Authors register on the AAAI web site
• March 18, 2005: Electronic submission of abstract.
• March 22, 2005: Electronic submission of paper.
• March 29, 2005: Submitters fax/mail one formatted title page, including tracking number, title, authors, and contact information
• April 29, 2005: Notification of acceptance or rejection
• May 10, 2005: Final, corrected PDF camera-ready copy due at AAAI office

Authors should submit abstracts by March 18, 2005 and papers by March 22, 2005. The software will assign paper ID number at the time of the submission. Vision/challenge papers should be clearly marked as such by selecting the keyword "vision/challenge" in addition to any applicable technical keywords.

Authors will receive confirmation of receipt of their papers shortly after submission. AAAI will contact authors again only if problems are encountered with papers. Inquiries regarding lost papers must be made no later than March 29, 2005.

AAAI-05
445 Burgess Drive, Suite 100
Menlo Park, CA 94025-3442
Telephone: 650-328-3123
Fax: 650-321-4457

Submissions to Other Conferences or Journals

Papers submitted to this conference must not have been accepted for publication elsewhere or be under review for another AI conference. However, to encourage interdisciplinary contributions, we may consider work that has been submitted or presented in part to a forum outside of AI. The guidelines of the AAAI policy on multiple submissions are fully detailed at the AAAI-05 web site and must be carefully followed.

Review Process

Program committee members will identify papers they are qualified to review based on the information submitted electronically (the paper's title, keywords, and abstract). Their reviewing will be done blind to the identities of the authors and their institutions. The program committee's reviews will make recommendations to the senior program committee, which in turn will make recommendations to the program cochairs. Although the program cochairs will formally make all final decisions, in practice almost all will be made earlier in the process.

This year, as an experiment, the cochairs are planning to allow authors of papers that may have conflicting reviews, a limited opportunity to respond to the reviews. This author's feedback may then be taken into account in making the final decisions. Further details on this specific "if controversial, hear the authors" idea will be made available on the AAAI-05 website.

Copyright

Sponsored By:

**********************************************************************

• Paper submission due: April 3, 2005
• Submission websites: http://www.comp.hkbu.edu.hk/WI05/
  http://www.hds.utc.fr/WI05/
• Electronic submissions are required in the form of PDF or PS files

**********************************************************************

Web Intelligence (WI) has been recognized as a new direction for scientific research and development to explore the fundamental role as well as practical impacts of Artificial Intelligence (AI) (e.g., knowledge representation, planning, knowledge discovery and data mining, intelligent agents, and social network intelligence) and advanced Information Technology (IT) (e.g., wireless networks, ubiquitous devices, social networks, and data/knowledge grids) on the next generation of Web-empowered products, systems, services, and activities. It is one of the most important as well as promising IT research fields in the era of Web and agent intelligence.

The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) will be jointly held with the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'05

The IEEE/WIC/ACM 2005 joint conferences are sponsored and organized by IEEE Computer Society Technical Committee on Computational Intelligence (TCCI) (http://www.cs.uvm.edu/~xwu/tcci/index.shtml), Web Intelligence Consortium (WIC) (http://wi-consortium.org), and ACM-SIGART (http://www.acm.org/sigart/).

Topics
The topics and areas include, but not limited to:

WI Topics

• World Wide Wisdom Web (W4)
• Social Networks and Social Intelligence
• Web Mining and Farming
• Semanitcs and Ontology Engineering
• Web Agents
• Web Services
• Web Information Filtering and Retrieval
• Intelligent Human Interaction
• Web Support Systems
• Intelligent E-Technology
• Knowledge Grids and Grid Intelligence
  

Important Dates

Electronic submission of full papers:  ** April 3, 2005 **
Notification of paper acceptance:     June 9, 2005
Workshop and tutorial proposals:     June 9, 2005
Camera-ready of accepted papers:     July 4, 2005
Workshops/Tutorials:     September 19, 2005
Conference:     September 20-22, 2005

On-Line Submissions and Publication
High-quality papers in all WI related areas are solicited. Papers exploring new directions or areas will receive a careful and supportive review.  All submitted papers will be reviewed on the basis of technical quality, relevance, significance, and clarity.
Note that WI'05 will accept ONLY on-line submissions, containing PDF (PostScript or MS-Word) versions.

The conference proceedings will be published by the IEEE Computer Society Press.

WI'05 also welcomes Industry Track and Demo submissions, Workshop and Tutorial proposals.

More detailed instructions and the On-Line Submission Form can be found from the WI'05 homepages: http://www.comp.hkbu.edu.hk/WI05/ or http://www.hds.utc.fr/WI05.

A selected number of WI'05 accepted papers will be expanded and revised for inclusion in Web Intelligence and Agent Systems: An International Journal (http://wi-consortium.org/journal.html) and in Annual Review of Intelligent Informatics (http://www.wi-consortium.org/annual.html)

The best paper awards will be conferred on the authors of the best papers at the conference.

Contact Information