AI 检索
AI 阅读
analysis
趋势分析
编组
开放平台
more
更多
排名必读论文期刊顶会热点AI 简史溯源树小脉星探人才迁徙塔尖人才国防情报追踪开源工具智慧手语
VIPCreated with Sketch.

Finite Satisfiability For Guarded Fixpoint Logic

Vince Barany,Mikolaj Bojanczyk

INFORMATION PROCESSING LETTERS（2012）

引用 13|浏览0
暂无评分
摘要
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTIME (resp. ExpTIME for formulas of bounded width). (C) 2012 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Formal methods,Guarded fragment,Guarded fixpoint logic,Finite satisfiability
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要