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, Time complexity, Unit clause.

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

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.

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 3.147.86.143

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). AN ALGORITHM FOR SATISFIABILITY DEGREE COMPUTATION. In Proceedings of the International Conference on Evolutionary Computation Theory and Applications (IJCCI 2011) - FCTA; ISBN 978-989-8425-83-6, SciTePress, pages 501-504. DOI: 10.5220/0003673205010504

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

TY - CONF

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