27th International Conference on Logic Programming


Lexington, Kentucky, USA, July 6-10, 2011
Submission deadline: Jan 10/17, 2011

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

  • Theory: Semantic Foundations, Formalisms, Non- monotonic Reasoning, Knowledge Representation.
  • Implementation: Compilation, Memory Management, Virtual Machines, Parallelism.
  • Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing.
  • Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes,  Assertions, Programming Techniques.
  • Related Paradigms: Abductive Logic Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming.
  • Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics.

The four broad categories for submissions are: (1) technical papers for describing technically sound, innovative ideas that can advance the state of the art of logic programming; (2) application papers, where the emphasis will be on their impact on the application domain; (3) system and tool papers, where the emphasis will be on the novelty, practicality, usability and general availability of the systems and tools described; and (4) technical communications, aimed at describing recent developments, new projects, and other materials that are not ready for main publication as standard papers.

All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. Technical papers, application papers, and system and tool papers must not exceed 15 pages plus bibliography. The limit for technical communications is 10 pages. Submissions must be made in TPLP format (ftp://ftp.cup.cam.ac.uk/pub/texarchive/journals/latex/tlp-cls/) via the Easychair submission system, available at http://www.easychair.org/conferences/?conf=iclp2011.


Paper registration (abstract): Jan 10, 2011
Submission deadline: Jan 17, 2011
Notification to authors: Mar 11, 2011
Camera-ready copy due: Apr 15, 2011
Conference: Jul 6-10, 2011


All accepted long papers will be published in the journal Theory and Practice of Logic Programming (TPLP), Cambridge U. Press (CUP), in one or more special issues. In order to ensure the quality of the final version, papers may be subject to more than one round of refereeing (within the decision period) and/or “shepherding.” The program committee may also recommend standard papers to be published as technical communications.

At the time of the conference CUP will make the web page for this(ese) TPLP issue(s) available including volume and issue numbers, table of contents, page numbers, and the papers themselves. All registered attendants at the conference will get a password for on-line access to this web page during the conference and indefinitely from then on (“lifetime access”), which can be used to read papers on line, download them, or print them for personal use. Attendants will also receive all the papers in a memory stick at the conference.

It is planned that the collection of technical communications will appear as a volume of the LIPIcs (Leibniz International Proceedings in Informatics) series, and published online through the Dagstuhl Research Online Publication Server (DROPS). All technical communications will also get space in the program for presentation. The journal issue(s) will also include a listing of the technical communications, with pointers to the LIPIcs/DROPS volume.


General Chair: Mirek Truszczynski (University of Kentucky), Victor Marek (University of Kentucky)
Program Co-chairs: John Gallagher (Roskilde University, Denmark and IMDEA, Spain) Michael Gelfond (Texas Tech University, USA)
Workshops Chair: Joohyung Lee (Arizona State University)
Publicity Chair: Yuliya Lierler (University of Kentucky)
Doctoral Consortium: Alessandro Dal Palù (Universit degli Studi di Parma),  Stefan Woltran (Vienna University of Technology)
Prolog Programming Contest: Tom Schrijvers (K.U. Leuven, Belgium)


The conference is sponsored by the Association for Logic Programming (ALP).


The Association for Logic Programming has funds to assist financially disadvantaged participants and, specially, students in order to be able to attend the conference.


The ICLP 2011 program will include several workshops, held before and after the main conference. They are perhaps the best places for the presentation of preliminary work, undeveloped novel ideas, and new open problems to a wide and interested audience with opportunities for intensive discussions and project collaboration.


The 7th Doctoral Consortium (DC) on Logic Programming provides research students with the opportunity to present and discuss their research directions, and to obtain feedback from both peers and world-renowned experts in the field. Accepted participants will receive partial financial support to attend the event and the main conference. The best paper and presentation from the DC will be given the opportunity to present in a special session of the main ICLP conference.


Lexington is a medium size, pleasant and quiet university town. It is located in the heart of the so-called Bluegrass Region in Central Kentucky. The city is surrounded by beautiful horse farms on green pastures dotted with ponds and traditional architecture stables, ponds and small race tracks, and bordered by white or black fences. The Horse Museum is as beautifully located as it is interesting. Overall, the city has a nice feel that mixes well old and new.

Traveling to Lexington is easy. The local airport has frequent direct flights to Cincinnati, Atlanta, Detroit, and Chicago. It has also direct but less frequent flights (one or two a day) to several other large US cities such as Dallas-Ft. Worth, Houston and Newark. Thus, it can be reached easily from any place in the world.