ICLP 2014

30th International Conference on Logic Programming
July 19-22, Vienna, Austria

  • ICLP takes place in the Hőrsaal 8 room on the 2nd floor of the Freihaus building.
  • Registration is open! Early registration ends June 8.
  • The summer school has been announced.
  • Travel support for student attendees is available.
  • The list of accepted papers is available.
  • The invited speakers have been announced.
  • Visa: After registration, participants who require a visa to attend ICLP can request an invitation letter from the company hired by FLoC to handle registration, Austropa Interconvention.
  • The supplementary style file for technical communications is now available below.

Since the first conference held in Marseilles 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, Nonmonotonic Reasoning, Knowledge Representation.
Implementation:
Compilation, Virtual Machines, Parallelism, Constraint Handling Rules and Tabling.
Environments:
Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing.
Language Issues:
Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Programming Techniques.
Related Paradigms:
Inductive and Coinductive Logic Programming, Constraint Logic Programming, Answer-Set Programming, SAT-Checking, Co-inductive LP.
Applications:
Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics.
In addition to the presentations of accepted papers, the technical program will include invited talks, advanced tutorials, the doctoral consortium, and several workshops. All accepted papers will be published in the special issue of the journal Theory and Practice of Logic Programming, Cambridge University Press.

The four broad categories for submissions are as follows.
  • Regular papers, including:
    • technical papers for describing technically sound, innovative ideas that can advance the state of logic programming;
    • application papers, where the emphasis will be on their impact on the application domain;
    • system and tool papers, where the emphasis will be on the novelty, practicality, usability and availability of the systems and tools described.
  • Technical communications aimed at escribing recent developments, new projects, and other materials that are not ready for publication as standard papers.

All papers and technical communications will be presented during the conference. All submissions 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 12 pages plus bibliography: however a new condensed TPLP format may be used and the papers may include appendices beyond 12 pages. The limit for technical communications is 10 pages. Submissions must be made in the condensed TPLP format via the Easychair submission system.

Update: The technical communications require the use of an additional latex style file supp.sty, which provides a few additional macros you need to use. In supp.zip you will find this style file as well as an example of its use. Look for "%%added" in the example for the few lines you need to add.

All accepted papers will be published in the journal Theory and Practice of Logic Programming (TPLP), Cambridge University 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). Accepted technical communications will be published in the on-line abstract of the special issue(s). 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.

(Quantified) Horn Constraint Solving for Program Verification and Synthesis

Andrey Rybalchenko, Microsoft Research

We show how automatic tools for the verification of linear and branching time properties of procedural, multi-threaded, and functional programs as well as program synthesis can be naturally and uniformly seen as solvers of constraints in form of (quantified) Horn clauses over background logical theories. Such a perspective can offer various advantages, e. g., a logical separation of concerns between constraint generation (also known as generation of proof obligations) and constraint solving (also known as proof discovery), reuse of solvers across different verifications tasks, and liberation of proof designers from low level algorithmic concerns and vice versa.

Combinatorial Search With Picat

Neng-Fa Zhou, City University of New York

Logic programming has made great strides in solving combinatorial search problems, as witnessed by the cultivation of CLP, ASP, and tabled Prolog systems. Picat, a new member of this family, follows a different doctrine than Prolog in offering the core logic programming concepts: arrays and maps as basic data types; implicit pattern matching with explicit unification and explicit non-determinism; functions that are easier to use than relations for deterministic computations; loops that are more convenient than recursion for scripting and modeling purposes. Picat provides facilities for solving combinatorial search problems, including a common interface with CP, SAT, and MIP solvers, tabling for dynamic programming, and a module for planning. Picat's planner module, which is implemented by use of tabling, has produced surprising and encouraging results; thanks to term-sharing and resource-bounded tabled search, it overwhelmingly outperforms the cutting-edge ASP and PDDL planners on several planning benchmarks used in recent ASP and IPC competitions.

Elvira AlbertComplutense University of Madrid
Sergio AntoyPortland State University
Marcello BalducciniDrexel University
François BryUniversity of Munich
Mats CarlssonSICS
Iliano CervesatoCarnegie Mellon University - Qatar Campus
Kaustuv ChaudhuriINRIA
Michael CodishBen-Gurion University
Danny De SchreyeKU Leuven
Marc DeneckerKU Leuven
Esra ErdemSabanci University
Samir GenaimUniversidad Complutense de Madrid
Gopal GuptaUniversity of Texas at Dallas
Michael HanusCAU Kiel
Rémy HaemmerléUniversidad Politécnica de Madrid
Ethan JacksonMicrosoft
Gerda JanssensKU Leuven
Michael KiferState University of New York at Stony Brook
Andy KingUniversity of Kent
Günter KnieselUniversity of Bonn
Yanhong Annie LiuState University of New York at Stony Brook
Michael MaherUniversity of New South Wales
Rainer MantheyUniversity of Bonn
Fred MesnardUniversite de la Reunion
Jose MoralesIMDEA Software Research Institute
Alberto PettorossiUniversità di Roma Tor Vergata
Gianfranco RossiUniversità di Parma
Vitor Santos CostaUniversidade do Porto
Peter SchachteUniversity of Melbourne
Torsten SchaubUniversity of Potsdam
Hirohisa SekiNagoya Institute of Technology
Peter StuckeyUniversity of Melbourne
Paul TarauUniversity of North Texas
Michael ThielscherUniversity of New South Wales
Hans TompitsVienna University of Technology
Francesca ToniImperial College London
German VidalUniversitat Politecnica de Valencia
Jan WielemakerUniversity of Amsterdam
Stefan WoltranVienna University of Technology
Neng-Fa ZhouCity University of New York
General Chair
Manuel Carro (Technical University of Madrid)
Program Chairs
Michael Leuschel (Heinrich-Heine-Universität Düsseldorf)
Tom Schrijvers (Ghent University)
Workshop Chair
Haifeng Guo (University of Nebraska at Omaha)
DC Chairs
Martin Gebser (Aalto University)
Jael Kriener (Microsoft Research - Inria Joint Center)