Sciweavers

1998 search results - page 155 / 400
» Basic Association Rules
Sort
View
IANDC
2010
84views more  IANDC 2010»
15 years 1 months ago
Modules over monads and initial semantics
Inspired by the classical theory of modules over a monoid, we introduce the natural notion of module over a monad. The associated notion of morphism of left modules (”linear” n...
André Hirschowitz, Marco Maggesi
100
Voted
SGAI
2007
Springer
15 years 8 months ago
Extending Jess to Handle Uncertainty
Computer scientists are often faced with the challenge of having to model the world and its associated uncertainties. One area in particular where modelling uncertainty is importa...
David Corsar, Derek H. Sleeman, Anne McKenzie
95
Voted
SKG
2006
IEEE
15 years 8 months ago
Abox Inference for Large Scale OWL-Lite Data
Abox inference is an important part in OWL data management. When involving large scale of instance data, it can not be supported by existing inference engines. In this paper, we p...
Xiaofeng Wang, Jianbo Ou, Xiaofeng Meng, Yan Chen
103
Voted
ACL
1998
15 years 4 months ago
Trigger-Pair Predictors in Parsing and Tagging
In this article, we apply to natural language parsing and tagging the device of triggerpair predictors, previously employed exclusively within the field of language modelling for ...
Ezra Black, Andrew M. Finch, Hideki Kashioka
105
Voted
KR
1992
Springer
15 years 6 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden