Sciweavers

111 search results - page 9 / 23
» Definability in Logic and Rough Set Theory
Sort
View
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
JANCL
2006
123views more  JANCL 2006»
13 years 7 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas
KAIS
2000
86views more  KAIS 2000»
13 years 7 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz
AMAI
2006
Springer
13 years 7 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
APAL
2005
154views more  APAL 2005»
13 years 7 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema