Query answering in rough knowledge bases

Authors:
Aida Vitória;Carlos Viegas Damásio;Jan Małuszyński
Affiliations:
Dept. of Science and Technology, Linköping University, Norrköping, Sweden;Centro de Inteligência Artificial, Dept. Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal;Dept. of Computer and Information Science, Linköping University, Linköping, Sweden
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 4
Cited 3

Answer sets and constructive logic, II: extended logic programs and related nonmonotonic formalisms

Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
VPRSM Approach to WEB Searching

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
A Logic Programming Framework for Rough Sets

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing

A four-valued logic for rough set-like approximate reasoning

Transactions on rough sets VI
A framework for reasoning with rough sets

Transactions on Rough Sets IV
From Rough Sets to Rough Knowledge Bases

Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a logic programming language which makes it possible to define and to reason about rough sets. In particular we show how to test for rough inclusion and rough equality. This extension to our previous work [7] is motivated by the need of these concepts in practical applications.