AN ALGORITHM FOR SATISFIABILITY DEGREE COMPUTATION

Jian Luo, Guiming Luo, Mo Xia

Abstract

Satisfiability degree describes the satisfiable extent of a proposition based on the truth table by finding out the proportion of interpretations that make the proposition true. This paper considers an algorithm for computing satisfiability degree. The proposed algorithm divides a large formula into two smaller formulas that can be further simplified by using unit clauses; once the smaller formulas contains only a clause or unit clauses, their satisfiability degrees can be directly computed. The satisfiability degree of the large formula is the difference of the two smaller ones. The correctness of the algorithm is proved and it has lower time complexity and space complexity than all the existing algorithms, such as the enumeration algorithm, the backtracking algorithm, the propositional matrix algorithm and so on. That conclusion is further verified by experimental results.

References

  1. Gerla, G. (1994). Inferences in probability logic. In Artificial Intelligence. vol. 70, no. 1-2, 1994, pp. 33-52.
  2. Huth, M. and Ryan, M. (2005). Logic in Computer Science. China Machine Press, Beijing, 2nd edition.
  3. Luo, J. and Luo, G. M. (2010). Propositional matrix search algorithm for satisfiability degree computation. In the 9th IEEE International Conference on Cognitive Informatics. Beijing, China, pp.974-977.
  4. Luo, G. M., Y. C. Y. and Hu, P. (2009). An algorithm for calculating the satisfiability degee. In proceedings of the 2009 sixth international Conference on Fuzzy System and Knowledge Discovery. Tianjin, China, 2009, pp.322-326.
  5. Malik, S., M. Y. and Fu, Z. (2005). Zchaff2004: An efficient sat solver. In in LNCS 3542, Theory and Applications of Satisfiability Testing. pp. 360C375.
  6. McMillan, K. L. (2002). Applying sat methods in unbounded symbolic model checking. In in Proc. Int. Conf. Computer-Aided Verification. vol.2404.
  7. Yin, C. Y., L. G. M. and Hu, P. (2009). Backtracking search algorithm for satisfiability degree calculation. In proceedings of the 2009 sixth international Conference on Fuzzy System and Knowledge Discovery. Tianjin,China,2009,pp.3-7.
  8. Zadeh, L. A. (1965). Fuzzy sets. In Information & Control. vol. 8, no. 3, 1965, pp. 338-353.
  9. Zhou, H. J. and Wang, G. J. (2006). A new theory consistency index based on deduction theorems in several logic systems. In Fuzzy Sets and Systems. vol.157, no.3, pp.427-443.
Download


Paper Citation


in Harvard Style

Luo J., Luo G. and Xia M. (2011). AN ALGORITHM FOR SATISFIABILITY DEGREE COMPUTATION . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FCTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 501-504. DOI: 10.5220/0003673205010504


in Bibtex Style

@conference{fcta11,
author={Jian Luo and Guiming Luo and Mo Xia},
title={AN ALGORITHM FOR SATISFIABILITY DEGREE COMPUTATION},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FCTA, (IJCCI 2011)},
year={2011},
pages={501-504},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003673205010504},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FCTA, (IJCCI 2011)
TI - AN ALGORITHM FOR SATISFIABILITY DEGREE COMPUTATION
SN - 978-989-8425-83-6
AU - Luo J.
AU - Luo G.
AU - Xia M.
PY - 2011
SP - 501
EP - 504
DO - 10.5220/0003673205010504