DocumentCode
3731400
Title
The New Directed Hypergraph for CNF Formula of Propositional Logic
Author
Zhijia Zhang;Yang Xu
Author_Institution
Syst. Credibility Autom. Verification Eng. Lab. of Sichuan Province, Southwest Jiaotong Univ., Chengdu, China
fYear
2015
Firstpage
133
Lastpage
137
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.
Keywords
"Computer science","Computational modeling","Intelligent systems","Knowledge representation","Cognition"
Publisher
ieee
Conference_Titel
Intelligent Systems and Knowledge Engineering (ISKE), 2015 10th International Conference on
Type
conf
DOI
10.1109/ISKE.2015.72
Filename
7383037
Link To Document