SATISFIABILITY DEGREE THEORY FOR TEMPORAL LOGIC

Jian Luo, Guiming Luo, Mo Xia

2011

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.

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