Sciweavers

605 search results - page 74 / 121
» Dealing with logical omniscience
Sort
View
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 2 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
CIKM
2005
Springer
14 years 2 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia
FSKD
2005
Springer
98views Fuzzy Logic» more  FSKD 2005»
14 years 2 months ago
Extraction of Representative Keywords Considering Co-occurrence in Positive Documents
In linear text classification, user feedback is usually used to tune up the representative keywords (RK) for a certain class. Despite some algorithms (e.g. Rocchio) deal well with...
Byeong Man Kim, Qing Li, KwangHo Lee, Bo-Yeong Kan...
ICCSA
2005
Springer
14 years 2 months ago
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
Almudena Alcaide, Juan M. Estévez-Tapiador,...
LPNMR
2005
Springer
14 years 2 months ago
An ID-Logic Formalization of the Composition of Autonomous Databases
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
Bert Van Nuffelen, Ofer Arieli, Alvaro Corté...