Sciweavers

339 search results - page 32 / 68
» The Retrieval Problem in a Concept Language with Number Rest...
Sort
View
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
CIKM
2005
Springer
14 years 1 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
ISDA
2008
IEEE
14 years 2 months ago
Compute the Term Contributed Frequency
In this paper, we propose an algorithm and data structure for computing the term contributed frequency (tcf) for all N-grams in a text corpus. Although term frequency is one of th...
Cheng-Lung Sung, Hsu-Chun Yen, Wen-Lian Hsu
LICS
1999
IEEE
13 years 12 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
ESE
1990
128views Database» more  ESE 1990»
13 years 11 months ago
Characterizing Diagnoses
Most approaches to model-based diagnosis describe a diagnosis for a system as a set of failing components that explains the symptoms. In order to characterize the typically very l...
Johan de Kleer, Alan K. Mackworth, Raymond Reiter