Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Xihua Daxue xuebao. Zhexue shehui kexue ban · 2012

Lower Bound of Maximal Horn of Horn Clause Set Σ

Zheng Pei

Cited by 0Abstract and details only

Abstract

Automatic reasoning is an important topic of artificial intelligence research.Fast reasoning based on Horn clauses is an important method for automatic reasoning.The relation between minimal model of Horn clauses and maximal lower bound of Horn clauses is discussed in this paper,the method for obtaining maximal lower bound of Horn clauses is proposed,which can be used in fast reasoning based on Horn clauses.

Cite this paper

APA 7

Pei, Z. (2012). Lower Bound of Maximal Horn of Horn Clause Set Σ. Xihua Daxue xuebao. Zhexue shehui kexue ban.

MLA 9

Pei, Zheng. “Lower Bound of Maximal Horn of Horn Clause Set Σ.” Xihua Daxue xuebao. Zhexue shehui kexue ban, 2012.

Chicago

Pei, Zheng. 2012. “Lower Bound of Maximal Horn of Horn Clause Set Σ.” Xihua Daxue xuebao. Zhexue shehui kexue ban.

Harvard

Pei, Z. (2012) ‘Lower Bound of Maximal Horn of Horn Clause Set Σ’, Xihua Daxue xuebao. Zhexue shehui kexue ban.

BibTeX
@article{pei2012lower,
  title = {{Lower Bound of Maximal Horn of Horn Clause Set Σ}},
  author = {Pei, Zheng},
  journal = {Xihua Daxue xuebao. Zhexue shehui kexue ban},
  year = {2012}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers