Sciweavers

413 search results - page 18 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
ICFP
2009
ACM
14 years 9 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
OTM
2005
Springer
14 years 2 months ago
Probabilistic Ontologies and Relational Databases
The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to ...
Octavian Udrea, Yu Deng, Edward Hung, V. S. Subrah...
ANLP
1994
113views more  ANLP 1994»
13 years 10 months ago
Acquiring Knowledge From Encyclopedic Texts
A computational model for the acquisition of knowledge from encyclopedic texts is described. The model has been implemented in a program, called SNOWY, that reads unedited texts f...
Fernando Gomez, Richard D. Hull, Carlos Segami
JMLR
2006
112views more  JMLR 2006»
13 years 8 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
WIDM
2003
ACM
14 years 2 months ago
Answering imprecise database queries: a novel approach
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfa...
Ullas Nambiar, Subbarao Kambhampati