Backtracking search algorithm for satisfiability degree calculation

Authors:
Chongyuan Yin;Guiming Luo;Pei Hu
Affiliations:
School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Year:
2009

Citing 8
Cited 0

Probabilistic logic

Artificial Intelligence
Inferences in probability logic

Artificial Intelligence
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Reasoning about Uncertainty

Reasoning about Uncertainty
Probabilistic logic learning

ACM SIGKDD Explorations Newsletter
Fuzzy decision support system for demand forecasting with a learning mechanism

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Satisfiability degree can compensate for the deficiency of classical logics in representing uncertainty. As the calculation of the satisfiability degree is an NP-complete problem, it is necessary to construct some- efficient algorithm. In this paper, an algorithm for computing the satisfiability degree of arbitrary propositional formula is proposed. It refers to and modifies the backtracking search algorithm used in the Boolean satisfiability problem. (SAT), making optimizations by using heuristic strategy and intelligent analysis. Experimental results compare the time consumed by the basic enumeration algorithm with this algorithm, indicating that this algorithm is extremely riffective for large formulas.