逆pdl的最优表决策过程

2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI:10.1109/KSE.2009.12

Linh Anh Nguyen, A. Szałas

{"title":"逆pdl的最优表决策过程","authors":"Linh Anh Nguyen, A. Szałas","doi":"10.1109/KSE.2009.12","DOIUrl":null,"url":null,"abstract":"We give a novel tableau calculus and an optimal (EXPTIME)tableau decision procedure based on the calculus for the satisfiability problem of propositional dynamic logic with converse. Our decision procedure is formulated with global caching and can be implemented together with useful optimization techniques.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"An Optimal Tableau Decision Procedure for Converse-PDL\",\"authors\":\"Linh Anh Nguyen, A. Szałas\",\"doi\":\"10.1109/KSE.2009.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a novel tableau calculus and an optimal (EXPTIME)tableau decision procedure based on the calculus for the satisfiability problem of propositional dynamic logic with converse. Our decision procedure is formulated with global caching and can be implemented together with useful optimization techniques.\",\"PeriodicalId\":347175,\"journal\":{\"name\":\"2009 International Conference on Knowledge and Systems Engineering\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Knowledge and Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE.2009.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Knowledge and Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2009.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

针对具有逆的命题动态逻辑的可满足性问题，给出了一种新的表演算方法和基于该方法的最优(EXPTIME)表决策过程。我们的决策过程是用全局缓存制定的，可以与有用的优化技术一起实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Optimal Tableau Decision Procedure for Converse-PDL

We give a novel tableau calculus and an optimal (EXPTIME)tableau decision procedure based on the calculus for the satisfiability problem of propositional dynamic logic with converse. Our decision procedure is formulated with global caching and can be implemented together with useful optimization techniques.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference on Knowledge and Systems Engineering

自引率

0.00%

发文量