A first-order logic for reasoning under uncertainty using rough sets

@article{Parsons1994AFL,
  title={A first-order logic for reasoning under uncertainty using rough sets},
  author={S. Parsons and Miroslav Kub{\'a}t},
  journal={Journal of Intelligent Manufacturing},
  year={1994},
  volume={5},
  pages={211-223}
}
  • S. Parsons, M. Kubát
  • Published 1 August 1994
  • Computer Science
  • Journal of Intelligent Manufacturing
Reasoning with uncertain information is a problem of key importance when dealing with knowledge from real situations. Obtaining the precise numbers required by many uncertainty-handling formalisms can be a problem when building real systems. The theory of rough sets allows us to handle uncertainty without the need for precise numbers, and so has some advantages in such situations. The authors develop a set of symbolic truth values based upon rough sets which may be used to augment predicate… 
Fuzzy Rough Approach To Handling Imprecision In Semantic Web Ontologies
  • P. Klinov, L. Mazlack
  • Computer Science
    NAFIPS 2006 - 2006 Annual Meeting of the North American Fuzzy Information Processing Society
  • 2006
TLDR
The aim of this paper is to show how rough set techniques can be complemented by rough set methods to capture another type of imprecision caused by approximation spaces.
Interval rough mereology and description logic: An approach to formal treatment of imprecision in the Semantic Web ontologies
Learning and maintaining ontologies play critically important roles in the Semantic Web. Ontologies provide formal and explicit semantics to available knowledge and make possible shared understanding
Granulating semantic web ontologies
  • P. Klinov, L. Mazlack
  • Computer Science
    2006 IEEE International Conference on Granular Computing
  • 2006
TLDR
This work plans to build rough approximations of concepts and relations to measure the roughness of generated ontologies and may expect a positive impact on the reasoning in the Semantic Web because of reductions in the complexity of object descriptions.
Roughness by Residuals - Algebraic Description of Rough Sets and an Algorithm for Finding Core Relations
TLDR
Rough set theory focuses on forming posets of equivalence relations to describe sets with increasing accuracy and has also been interpreted as a variant of intuitionistic or multi-valued logics and has even been studied in the context of logic programming.
Rough Sets and Relational Learning
TLDR
An overview of the work in Rough Sets and Relational Learning is presented, including the extension of Rough Set Theory to Relational learning.
Knowledge Representation and Logic for Beliefs
  • Computer Science
  • 2004
TLDR
A logic system called BAF-Logic based on fuzzy-logic style min-max functions and Predicate Logic is introduced to perform reasoning on BAF and their relations to solve the text classification problem.
A Novel Approach Based on Rough Conditional Entropy for Attribute Reduction
TLDR
A new rough conditional entropy based uncertainty measure is introduced to evaluate the significance of subsets of attributes in incomplete decision systems and three attribute selection approaches are constructed, including an exhaustive approach, a heuristic approach, and a probabilistic approach.
Entropy based attribute reduction approach for incomplete decision table
  • Yan Tao, Han Chong-zhao
  • Computer Science
    2017 20th International Conference on Information Fusion (Fusion)
  • 2017
TLDR
A new entropy based uncertainty measure is introduced for evaluating the significance of subsets of attributes in incomplete decision tables and three attribute reduction algorithms are provided, including an algorithm using exhaustive search, an algorithms using heuristic search and an algorithmUsing probabilistic search for incomplete decision table reduction.
A Novel Approach of Rough Conditional Entropy-Based Attribute Selection for Incomplete Decision System
TLDR
A new rough conditional entropy-based uncertainty measure is introduced to evaluate the significance of subsets of attributes in incomplete decision systems and three attribute selection approaches are constructed, indicating that two of these approaches can give satisfying performances in the process of attribute selection incomplete decision systems.
Lattice-valued interval sets and t-representable interval set t-norms
  • Xiao-hong Zhang, Xiuyi Jia
  • Computer Science, Mathematics
    2009 8th IEEE International Conference on Cognitive Informatics
  • 2009
TLDR
The notion of lattice-valued interval set is introduced, and its basic algebra operations are investigated, and a fundamental theorem related residuated implication of t-representable interval set t-norms is proved.
...
...

References

SHOWING 1-10 OF 47 REFERENCES
A rough set approach to reasoning under uncertainty
TLDR
This paper presents an introduction to various forms of reasoning under uncertainty that are based on rough sets, and a semantics for these values is provided based upon the notion of possible worlds.
Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision, and Variable Certainty Weights
TLDR
An approach to automated deduction under uncertainty, based on possibilistic logic, is described, in which deduction from a partially inconsistent knowledge base can be managed in this approach and captures a form of nonmonotonicity.
Probabilistic Logic
  • N. Nilsson
  • Philosophy, Computer Science
    Artif. Intell.
  • 1986
Resolution principles in possibilistic logic
Probabilistic reasoning in intelligent systems - networks of plausible inference
  • J. Pearl
  • Computer Science
    Morgan Kaufmann series in representation and reasoning
  • 1989
TLDR
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Expressive Power of Knowledge Representation Systems
Representing uncertain knowledge - an artificial intelligence approach
TLDR
This book argues that Bayesian Probability, a model based on the Dempster-Shafer Theory of Evidence, can be used as a guide to reasoning with Imprecise and Vague Data.
A Belief-Function Logic
TLDR
A number of properties of first-order logic nicely generalize to BFL; in return, BFL gives a new perspective on some important points of Dempster-Shafer theory (e.g., the role of Dem pster's combination rule).
...
...