A Topology Graph Algorithm Based on Lattice-Valued Logic to Solve Satisfiability Problems

Jieqing Tan, Yingjie Li and Giuseppe D'Aniello

Mathematical Problems in Engineering, 2022, vol. 2022, 1-9

Abstract: Automatic reasoning is a very challenging research area in the field of artificial intelligence. Automatic inference based on lattice-valued logic is an important basic research content in the field of intelligent information processing. It is of great academic significance to deal with incomparability, linguistic valued information, and formal verification of the correctness of corresponding software and hardware systems in various applications. Based on the extensive work of α-resolution automated reasoning in linguistic truth-valued lattice-valued logic, this paper discusses the structure and its α-resolvability of the generalized literal. For further improving the efficiency, a topology graph deduction is proposed as well as its soundness, completeness, and universal algorithm. The use of distributed computing and resource sharing is the core idea of this deduction. In the decision process, as long as one satisfiability solution is found by subtask, the decision result can be given directly, shortening the decision time. The algorithm reduces the time complexity from factorial level to square.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/2677457.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/2677457.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2677457

DOI: 10.1155/2022/2677457

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().