Affiliation:
1. School of Computer and Information, Hefei University of Technology, Hefei, Anhui 230071, China
2. Faculty of Data Science, City University of Macau, Macau 99078, China
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.
Funder
National Natural Science Foundation of China
Subject
General Engineering,General Mathematics
Reference38 articles.
1. The complexity of theorem-proving procedures;S. A. Cook
2. Random satisfiability;D. Achlioptas;Handbook of Satisfiability,2009
3. PicoSAT Essentials
4. Constructing SAT Filters with a Quantum Annealer
5. Coupling reverse engineering and SAT to tackle NP-complete arithmetic circuitry verification in∼ O (# of gates);Y. Diao
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献