Sciweavers

111 search results - page 10 / 23
» Definability in Logic and Rough Set Theory
Sort
View
WEBI
2007
Springer
14 years 1 months ago
Knowledge Retrieval (KR)
With the ever-increasing growth of data and information, finding the right knowledge becomes a real challenge and an urgent task. Traditional data and information retrieval syste...
Yiyu Yao, Yi Zeng, Ning Zhong, Xiangji Huang
TYPES
1998
Springer
13 years 11 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
JLP
2000
134views more  JLP 2000»
13 years 7 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
RSCTC
2004
Springer
121views Fuzzy Logic» more  RSCTC 2004»
14 years 25 days ago
On the Correspondence between Approximations and Similarity
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
Patrick Doherty, Andrzej Szalas
CORR
2002
Springer
85views Education» more  CORR 2002»
13 years 7 months ago
The partition semantics of questions, syntactically
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
Chung-chieh Shan, Balder ten Cate