α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal la...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2015-12-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25868666.pdf |
id |
doaj-68d24f083fbf4a698007cecc3ef25f68 |
---|---|
record_format |
Article |
spelling |
doaj-68d24f083fbf4a698007cecc3ef25f682020-11-25T02:01:34ZengAtlantis PressInternational Journal of Computational Intelligence Systems 1875-68832015-12-01810010.1080/18756891.2015.1129580α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic SystemsWeitao XuWenqiang ZhangDexian ZhangYang XuXiaodong PanIn this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit lattice-valued Horn generalized clause are given in ℒ P(X). Then, the α-resolution of two lattice-valued Horn generalized clauses is represented in ℒ P(X). It indicates the reasoning rules in a resolution process, which aims at deleting α-resolution literals and obtaining a resolvent. Finally, we build an α-resolution algorithm for a set of lattice-valued Horn generalized clauses in ℒ P(X). It provides a foundation for automated reasoning in lattice-valued first-order logic system and an application for designing an inference system in the field of intelligent decision support.https://www.atlantis-press.com/article/25868666.pdfautomated reasoninglattice-valued logicα-resolutionlattice-valued Horn g-clauselattice implication algebra |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Weitao Xu Wenqiang Zhang Dexian Zhang Yang Xu Xiaodong Pan |
spellingShingle |
Weitao Xu Wenqiang Zhang Dexian Zhang Yang Xu Xiaodong Pan α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems International Journal of Computational Intelligence Systems automated reasoning lattice-valued logic α-resolution lattice-valued Horn g-clause lattice implication algebra |
author_facet |
Weitao Xu Wenqiang Zhang Dexian Zhang Yang Xu Xiaodong Pan |
author_sort |
Weitao Xu |
title |
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems |
title_short |
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems |
title_full |
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems |
title_fullStr |
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems |
title_full_unstemmed |
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems |
title_sort |
α-resolution method for lattice-valued horn generalized clauses in lattice-valued propositional logic systems |
publisher |
Atlantis Press |
series |
International Journal of Computational Intelligence Systems |
issn |
1875-6883 |
publishDate |
2015-12-01 |
description |
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit lattice-valued Horn generalized clause are given in ℒ P(X). Then, the α-resolution of two lattice-valued Horn generalized clauses is represented in ℒ P(X). It indicates the reasoning rules in a resolution process, which aims at deleting α-resolution literals and obtaining a resolvent. Finally, we build an α-resolution algorithm for a set of lattice-valued Horn generalized clauses in ℒ P(X). It provides a foundation for automated reasoning in lattice-valued first-order logic system and an application for designing an inference system in the field of intelligent decision support. |
topic |
automated reasoning lattice-valued logic α-resolution lattice-valued Horn g-clause lattice implication algebra |
url |
https://www.atlantis-press.com/article/25868666.pdf |
work_keys_str_mv |
AT weitaoxu aresolutionmethodforlatticevaluedhorngeneralizedclausesinlatticevaluedpropositionallogicsystems AT wenqiangzhang aresolutionmethodforlatticevaluedhorngeneralizedclausesinlatticevaluedpropositionallogicsystems AT dexianzhang aresolutionmethodforlatticevaluedhorngeneralizedclausesinlatticevaluedpropositionallogicsystems AT yangxu aresolutionmethodforlatticevaluedhorngeneralizedclausesinlatticevaluedpropositionallogicsystems AT xiaodongpan aresolutionmethodforlatticevaluedhorngeneralizedclausesinlatticevaluedpropositionallogicsystems |
_version_ |
1724957002033004544 |