Rough Sets and Approximation Schemes

Authors:
Victor W. Marek;Mirosław Truszczynski
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA;Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 10
Cited 2

Negation in logic programming

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Contributions to the theory of rough sets

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Uniform semantic treatment of default and autoepistemic logics

Artificial Intelligence
Answer sets for consistent query answering in inconsistent databases

Theory and Practice of Logic Programming
Ultimate approximation and its application in nonmonotonic knowledge representation systems

Information and Computation

Rough Set Algebras as Description Domains

Fundamenta Informaticae
Approximation Space and LEM2-like Algorithms for Computing Local Coverings

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate reasoning is used in a variety of reasoning tasks in Logic-based Artificial Intelligence. In this abstract we compare a number of such reasoning schemes and show how they relate and differ from the approach of Pawlak's Rough Sets.