中国计算机学会(CCF)推荐学术会议-A(计算机科学理论):LICS 2026

The 41st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2026) will be held in Lisbon, from 20 -- 23 July 2026, as part of the Federated Logic Conference FLOC'26.

The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed.

重要信息

CCF推荐:A(计算机科学理论)

录用率:30.7%(66/215,2025年)

时间地点:2026年7月20日-里斯本·葡萄牙

截稿时间:2026年1月15日

大会官网:https://lics.siglog.org/lics26/

Call for Papers

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, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, 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, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, type theory, and verification.

Paper instructions

Papers must be generated by using pdflatex and an up-to-date LaTeX system. The formatting of the paper is flexible. The length of the full paper however must be at most 12 pages in ACM SIGCONF Proceedings 2-column 10pt format excluding references.

Distinguished Papers

Around 10% of accepted papers will be selected as distinguished papers. These are papers that, in the view of the LICS program committee, make exceptionally strong contribution to the field and should be read by a broad audience due their relevance, originality, significance and clarity.

相关推荐
用户938515635072 小时前
从 O(n²) 到 O(nlogn):一文读懂快速排序的“快”与“妙”
javascript·算法
To_OC3 小时前
手写快排次次翻车?别死背快排模板了,这才是面试官想听的底层逻辑
javascript·算法·排序算法
饼干哥哥3 小时前
Reddit VOC调研太慢?搭一个AI专家团队半小时洞察任何品类|以猫用饮水机为例
人工智能·算法·ai编程
地平线开发者5 小时前
Transformer模型部署之性能优化指南
算法
地平线开发者5 小时前
人在途中:从“编译失败”到“模型可落地”——CUDA 自定义算子
算法·自动驾驶
半个落月8 小时前
从递归到快速排序:用 JavaScript 把分治思想讲明白
javascript·算法·面试
小月土星9 小时前
JavaScript 快速排序:从 pivot、双指针到分治思想
javascript·算法·面试
小月土星9 小时前
JavaScript 递归入门:从 1 到 n 求和,再到数组扁平化
javascript·算法·面试
To_OC1 天前
LC 1 两数之和:面试第一道必考题,暴力解法直接被面试官 pass
javascript·算法·leetcode