Proceedings Article10.1109/FSKD.2009.782
Backtracking Search Algorithm for Satisfiability Degree Calculation
Chongyuan Yin,Guiming Luo,Pei Hu +2 more
- 14 Aug 2009
- Vol. 2, pp 3-7
7
TL;DR: An algorithm for computing the satisfiability degree of arbitrary propositional formula is proposed that refers to and modifies the backtracking search algorithm used in the Boolean satisfiability problem (SAT), making optimizations by using heuristic strategy and intelligent analysis.
read more
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 effective for large formulas.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Proposition matrix search algorithm for satisfiability degree computation
Jian Luo,Guiming Luo +1 more
- 07 Jul 2010
TL;DR: The proposition matrix is proposed to construct the proposition matrix search algorithm, which uses a truth detector to detect the truth value of a proposition so that computation times can be reduced significantly.
6
Satisfiability degree analysis for transition system
Yang Zhao,Guiming Luo +1 more
- 23 Oct 2010
TL;DR: Finite paths transition system (FPTS) for calculating satisfiability degree of a LTL logic formula and a case named leader election shows the practicability of Satisfiability degree for transition system, which cannot be solved by classical model checking.
2
Satisfiability degree computation for linear temporal logic
Jian Luo,Guiming Luo,Yang Zhao +2 more
- 08 Sep 2011
TL;DR: The satisfiability degree for temporal logic is introduced and it is shown that the intelligent path selection algorithm has a polynomial time complexity and O(n2) space complexity.
2
An Algorithm for Satisfiability Degree Computation.
Jian Luo,Guiming Luo,Mo Xia +2 more
- 01 Jan 2011
TL;DR: In this article, the authors proposed an algorithm for computing satisfiability degree, which divides a large formula into two smaller formulas and uses unit clauses to reduce the complexity of the large formula.
1
•Proceedings Article
Satisfiability degree theory for temporal logic
Jian Luo,Guiming Luo,Mo Xia +2 more
- 20 Aug 2018
TL;DR: The requirements of the proposition satisfiability are reviewed and one example of a leadership election is included to show that uncertain information can be quantized by the satisfiability degree.
References
•Book
Fuzzy sets
Lotfi A. Zadeh
- 01 Aug 1996
TL;DR: A separation theorem for convex fuzzy sets is proved without requiring that the fuzzy sets be disjoint.
53.2K
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Related Papers (5)
R. Ostrowski,Bertrand Mazure,Lakhdar Sais,Éric Grégoire +3 more
- 03 Nov 2003
W.M. Spears
- 01 Jan 1996