loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jian Luo ; Guiming Luo and Mo Xia

Affiliation: Tsinghua University, China

Keyword(s): Satisfiability degree, Propositional logic, Temporal logic, Reasoning.

Related Ontology Subjects/Areas/Topics: Approximate Reasoning and Fuzzy Inference ; Artificial Intelligence ; Computational Intelligence ; Fuzzy Systems ; Mathematical Foundations: Fuzzy Set Theory and Fuzzy Logic ; Soft Computing ; Type-2 Fuzzy Logic

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.221.167.11

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 (IJCCI 2011) - FCTA; ISBN 978-989-8425-83-6, SciTePress, pages 497-500. DOI: 10.5220/0003672804970500

@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 (IJCCI 2011) - FCTA},
year={2011},
pages={497-500},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003672804970500},
isbn={978-989-8425-83-6},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications (IJCCI 2011) - FCTA
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
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic