Sciweavers

505 search results - page 8 / 101
» Approximate databases: a support tool for approximate reason...
Sort
View
FOIS
2006
13 years 9 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
COLING
2008
13 years 9 months ago
A Linguistic Knowledge Discovery Tool: Very Large Ngram Database Search with Arbitrary Wildcards
In this paper, we will describe a search tool for a huge set of ngrams. The tool supports queries with an arbitrary number of wildcards. It takes a fraction of a second for a sear...
Satoshi Sekine
AIPS
2007
13 years 10 months ago
Cost-Sharing Approximations for h+
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
Vitaly Mirkis, Carmel Domshlak
ICDE
1998
IEEE
121views Database» more  ICDE 1998»
14 years 9 months ago
Fuzzy Triggers: Incorporating Imprecise Reasoning into Active Databases
Traditional Event-Condition-Action triggers (active database rules) include a Boolean predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utiliz...
Antoni Wolski, Tarik Bouaziz
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
14 years 1 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati