Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | null | ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS |
Keywords | Field | DocType |
Satisfiability degree,Propositional logic,Temporal logic,Reasoning | Interval temporal logic,Multimodal logic,Algorithm,Zeroth-order logic,Theoretical computer science,Linear temporal logic,Temporal logic,Higher-order logic,Mathematics,Dynamic logic (modal logic),Intermediate logic | Conference |
Volume | Issue | Citations |
null | null | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Luo | 1 | 5 | 2.83 |
| Guiming Luo | 2 | 69 | 28.79 |
| Mo Xia | 3 | 0 | 0.34 |