SATISFIABILITY DEGREE THEORY FOR TEMPORAL LOGIC

Jian Luo, Guiming Luo, Mo Xia

Abstract

The truth value of propositional logic is not capable of representing the real word full of complexity and diversity. The requirements of the proposition satisfiability are reviewed in this paper. Every state is labeled with a vector, which is defined by the proposition satisfiability degree. The satisfiability degree for temporal logic is proposed based on the vector of satisfiability degree. It is used to interpret the truth degree of the temporal logic instead of true or false. A sound and precise reasoning system for temporal logic is established and the computation is given. One example of a leadership election is included to show that uncertain information can be quantized by the satisfiability degree.

References

  1. Bergmann, M. (2008).
  2. Hu, P., Luo, G. M., and Yin, X. Y. (2009). Computation of satisfiability degree based on cnf. In Proceedings of the International Conference on Fuzzy Systems and Knowledge Discovery. v6:142-146.
  3. Huth, M. and Ryan, M. (2005). Logic in Computer Science: Modeling and Reasoning about Systems. China Machine Press, Beijing, 2nd edition.
  4. Kang, H. and Park, I. (2005).
  5. Sat-based unbounded symbolic model chcking. In IEEE Transactions on Computer-aided Design of Integrated circuits and systems. vol.24(2):129-140.
  6. Luo, G. M. and Yin, C. Y. (2009). An algorithm for calculating the satisfiability degee. In proceedings of the 2009 sixth international Conference on Fuzzy System and Knowledge Discovery. pp.322-326.
  7. 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.
  8. Mattolini, P. B. R. and Nesi, P. (2000). Temporal logics for real time system specification. In ACM Comput.
  9. Surveys. vol.32, no.1, pp.12-42.
  10. Raedt, L. D. and Kersting, K. (2003). Probabilistic logic learning. In ACM SIGKDD Explorations Newsletter.
  11. vol.5(1),31-48.
  12. Yin, C. Y., Luo, G. M., and Hu, P. (2009). Backtracking search algorithm for satisfiability degree calculation.
  13. In proceedings of the 2009 sixth international Conference on Fuzzy System and Knowledge Discovery.
  14. Tianjin,China,2009,pp.3-7.
Download


Paper Citation


in Harvard Style

Luo J., Luo G. and Xia M. (2011). SATISFIABILITY DEGREE THEORY FOR TEMPORAL LOGIC . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FCTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 497-500. DOI: 10.5220/0003672804970500


in Bibtex Style

@conference{fcta11,
author={Jian Luo and Guiming Luo and Mo Xia},
title={SATISFIABILITY DEGREE THEORY FOR TEMPORAL LOGIC},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FCTA, (IJCCI 2011)},
year={2011},
pages={497-500},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003672804970500},
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 - SATISFIABILITY DEGREE THEORY FOR TEMPORAL LOGIC
SN - 978-989-8425-83-6
AU - Luo J.
AU - Luo G.
AU - Xia M.
PY - 2011
SP - 497
EP - 500
DO - 10.5220/0003672804970500