Sciweavers

7123 search results - page 267 / 1425
» The Ordered Set of Rough Sets
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
16 years 28 days ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
TREC
2004
15 years 8 months ago
Overview of the TREC 2004 Novelty Track
TREC 2004 marks the third and final year for the novelty track. The task is as follows: Given a TREC topic and an ordered list of documents, systems must find the relevant and nov...
Ian Soboroff
COMBINATORICS
2006
120views more  COMBINATORICS 2006»
15 years 6 months ago
Cycle Lengths in a Permutation are Typically Poisson
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
Andrew Granville
JSYML
2008
86views more  JSYML 2008»
15 years 6 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
MST
2008
119views more  MST 2008»
15 years 6 months ago
Logical Equivalence for Subtyping Object and Recursive Types
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
Steffen van Bakel, Ugo de'Liguoro