命题逻辑CNF公式的新有向超图

2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE) Pub Date : 2015-11-01 DOI:10.1109/ISKE.2015.72

Zhijia Zhang, Yang Xu

{"title":"命题逻辑CNF公式的新有向超图","authors":"Zhijia Zhang, Yang Xu","doi":"10.1109/ISKE.2015.72","DOIUrl":null,"url":null,"abstract":"Propositional logic is a highly important formalism language in knowledge representation and automatic reasoning. In the present paper, directed hypergraph is a tool used to represent CNF formula and explore SAT problems. The directed hypergraph associated with CNF formula is constructed and the one-to-one correspondence between them is proved. Some equivalent results are analyzed the relationships of two clauses and directed hyperarcs. Due to B-graphs can't represent all Horn formulas directly, we define the extended B-graph associated with them and a new way to express hyperpath. The satisfiability of special cases of Horn formula is given.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The New Directed Hypergraph for CNF Formula of Propositional Logic\",\"authors\":\"Zhijia Zhang, Yang Xu\",\"doi\":\"10.1109/ISKE.2015.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Propositional logic is a highly important formalism language in knowledge representation and automatic reasoning. In the present paper, directed hypergraph is a tool used to represent CNF formula and explore SAT problems. The directed hypergraph associated with CNF formula is constructed and the one-to-one correspondence between them is proved. Some equivalent results are analyzed the relationships of two clauses and directed hyperarcs. Due to B-graphs can't represent all Horn formulas directly, we define the extended B-graph associated with them and a new way to express hyperpath. The satisfiability of special cases of Horn formula is given.\",\"PeriodicalId\":312629,\"journal\":{\"name\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2015.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

命题逻辑是知识表示和自动推理中非常重要的形式主义语言。在本文中，有向超图是用来表示CNF公式和探索SAT问题的工具。构造了与CNF公式相关的有向超图，并证明了它们之间的一一对应关系。分析了两个子句与有向超弧之间的等价关系。由于b图不能直接表示所有的Horn公式，我们定义了与之相关的扩展b图，并给出了一种表示超路径的新方法。给出了Horn公式特殊情况的可满足性。

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

查看原文本刊更多论文

The New Directed Hypergraph for CNF Formula of Propositional Logic

Propositional logic is a highly important formalism language in knowledge representation and automatic reasoning. In the present paper, directed hypergraph is a tool used to represent CNF formula and explore SAT problems. The directed hypergraph associated with CNF formula is constructed and the one-to-one correspondence between them is proved. Some equivalent results are analyzed the relationships of two clauses and directed hyperarcs. Due to B-graphs can't represent all Horn formulas directly, we define the extended B-graph associated with them and a new way to express hyperpath. The satisfiability of special cases of Horn formula is given.

求助全文

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

来源期刊

2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)

自引率

0.00%

发文量