An algorithm for calculating the satisfiability degree

Authors:
Guiming Luo;Chongyuan Yin;Pei Hu
Affiliations:
School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Year:
2009

Citing 6
Cited 0

Probabilistic logic

Artificial Intelligence
Inferences in probability logic

Artificial Intelligence
Reasoning about Uncertainty

Reasoning about Uncertainty
Probabilistic logic learning

ACM SIGKDD Explorations Newsletter
Logic in Computer Science: Modelling and Reasoning about Systems

Logic in Computer Science: Modelling and Reasoning about Systems
Fuzzy decision support system for demand forecasting with a learning mechanism

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the real world, there are situations of uncertainty that the classical logics are not capable to represent, consequently some non-classical logics emerged to compensate for the deficiency of the classical logics of expressing uncertainty. Satisfiability degree was presented as a new means of representing uncertainty. In this talk some properties of the satisfiability degree are viewed. An algorithm is proposed for computing the satisfiability degree of any proposition, which is developed by using XOBDD, an extension of OBDD.