All CFPs on WikiCFP
Present CFP : 2018
Preliminary Call for Papers
LICS 2018 will be hosted in Oxford during 9–12 July 2018, as part of the Federated Logic Conference (FLOC).
The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include:
automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.
Instructions to Authors
Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE).
Titles and Short Abstracts Due 24 January 2018
Full Papers Due 31 January 2018
Author Feedback/Rebuttal Period 14–18 March 2018
Author Notification 31 March 2018
Early Registration Deadline 6 June 2018
Final Versions Due for Proceedings TBA
Conference 9–12 July 2018
Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2018.
Provisional formatting instructions: Every full paper must be submitted in the ACM SIGPLAN Proceedings 2-column 9pt format and may not be longer than 10 pages, including references. The LaTeX style file is available from here.
The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Submissions not conforming to the above requirements will be rejected without further consideration. Paper selection will be merit-based, with no a priori limit on the number of accepted papers. Papers authored or co-authored by members of the program committee are not allowed.
Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference.
Kleene Award for Best Student Paper
An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. The 2018 edition of the award is sponsored by the European Association for Theoretical Computer Science (EATCS).
Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science.