【24h】

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

机译:具有传递性的受保护片段的有限可满足性问题

获取原文
获取原文并翻译 | 示例

摘要

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2ExPTIME-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
机译:我们研究了具有可传递性的受保护片段的有限可满足性问题。我们证明,在一个及物谓词的情况下,该问题是可判定的,并且其复杂性与一般可满足性问题相同,即2ExPTIME-complete。我们还表明,具有仅在警卫中使用的更多及物谓词的GF句子的有限模型与无限模型具有本质上不同的属性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号