Sciweavers

653 search results - page 95 / 131
» The Logic of Learning
Sort
View
ICML
2008
IEEE
16 years 20 days ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
ESWS
2007
Springer
15 years 6 months ago
Acquisition of OWL DL Axioms from Lexical Resources
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...
Johanna Völker, Pascal Hitzler, Philipp Cimia...
HICSS
2002
IEEE
92views Biometrics» more  HICSS 2002»
15 years 4 months ago
Student Model of Historical Text Comprehension
: In this contribution we present a Learner Model (LM) of Historical Text Comprehension (HTC), which infers the cognitive profile of learner’s global comprehension concerning the...
Grammatiki Tsaganou, Maria Grigoriadou, Theodora C...
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 3 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
ALT
2010
Springer
15 years 1 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark