会议信息

FSCD 2026: International Conference on Formal Structures for Computation and Deduction

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
FSCD
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2026-01-23
通知日期:
2026-04-16
会议日期:
2026-07-20
会议地点:
Lisbon, Portugal
届数:
11
CCF: C   ICORE: B   浏览: 20962   关注: 3   参加: 1

会伴指数 (CP-I)

56.0 / 100
全站第 754 名 / 共 5,652 个会议 · 前 14%
学术认可 (35%)
72
投稿选择性 (20%) 无数据 —— 按中性基准 50 分计入 —
会议传承 (20%)
67
社区关注 (10%)
22
资料公开度 (15%)
35

用到的输入: 收录等级：CCF C, ICORE B · 有据可查的届次：11 · 在会伴关注它的研究者：3 人 · 过去 24 个月打开过本页的研究者：2 人

公开资料里还缺: 历年录用率 (+4.5) · 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 80% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-08

征稿

FSCD 2026 (International Conference on Formal Structures for Computation and Deduction) is a CCF C / ICORE B conference held in Lisbon, Portugal on 2026-07-20. The paper submission deadline is 2026-01-23. Acceptance notifications are sent on 2026-04-16.

OVERVIEW FSCD covers all aspects of formal structures for computation and deduction, from theoretical foundations to applications. Building on two communities — RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications) — FSCD embraces their core topics and broadens their scope to closely related areas in logic, models of computation, semantics, and verification in new challenging areas. The suggested (but not exclusive) list of topics for submission is: 1. Calculi Rewriting systems (string, term, higher-order, nominal, graph, conditional, modulo, infinitary, etc.) Lambda calculus Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) Proof theory (natural deduction, sequent calculus, proof nets, etc.) Type theory and logical frameworks Homotopy type theory Process algebras (synchronous, asynchronous, static and dynamic semantics with and without time, etc.) Quantum calculi 2. Methods in Computation and Deduction Type systems (polymorphism, dependent, recursive, intersection, session, etc.) Induction, coinduction Matching, unification, completion, orderings Strategies (normalisation, completeness, etc.) Tree automata Model building and model checking Proof search and theorem proving Constraint solving and decision procedures 3. Semantics Operational semantics and abstract machines Game semantics and applications Domain theory and categorical models Quantitative models (timing, probabilities, etc.) Quantum computation and emerging models of computation 4. Algorithmic Analysis and Transformations of Formal Systems Type inference and type checking Abstract interpretation Complexity analysis and implicit computational complexity Checking termination, confluence, derivational complexity and related properties Symbolic computation 5. Tools and Applications Programming and proof environments Verification tools Proof assistants and interactive theorem provers Applications in industry Applications of formal systems in other sciences Applications of formal systems in education 6. Formal Systems for Modelling and Verification in New Challenging Areas Certification Security Blockchain Databases Deep learning and machine learning algorithms Planning
由 Dou Sun 最后更新于

相关会议

相关期刊

CCF全称影响因子出版商ISSN
Computers & Structures4.8Elsevier0045-7949
CKnowledge-Based Systems7.2Elsevier0950-7051
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
CIEEE Transactions on Industrial Informatics11.7IEEE1551-3203
CIEEE Internet of Things Journal8.9IEEE2327-4662
CEngineering Applications of Artificial Intelligence9.0Elsevier0952-1976
CExpert Systems with Applications7.5Elsevier0957-4174
CIEEE Transactions on Big Data5.7IEEE2332-7790

评论 0

暂无评论。

请登录后发表评论