From rough sets to rough knowledge bases

Authors:
Aida Vitória;Carlos Viegas Damásio;Jan Maluszyński
Affiliations:
Dept. of Science and Technology, Linköping University, S 601 74 Norrköping, Sweden;Centro de Inteligência Artificial (CENTRIA), Dept. Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal;Dept. of Computer and Information Science, Linköping University, S 581 83 Linköping, Sweden
Venue:
Fundamenta Informaticae
Year:
2003

Citing 6
Cited 3

Logic programs with classical negation

Logic programming
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
Variable precision rough set model

Journal of Computer and System Sciences
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

Approximate reasoning in structural funds knowledge management system

AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
Rough subsumption reasoning with rOWL

Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment
A framework for reasoning with rough sets

Transactions on Rough Sets IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an expressive language for representing knowledge about vague concepts. It is based on the rough set formalism and it caters for implicit definition of rough relations by combining different regions (e.g. upper approximation, lower approximation, boundary) of other rough relations. The semantics of the proposed language is obtained by translating it to the language of extended logic programs whose meaning is captured by paraconsistent stable models. A query language is also discussed to retrieve information about the defined rough relations. Motivating examples illustrating the use of the language are described.