Sciweavers

675 search results - page 114 / 135
» Using Fairness to Make Abstractions Work
Sort
View
AAAI
1996
15 years 1 months ago
Closed Terminologies in Description Logics
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the ...
Robert A. Weida
ICFP
2004
ACM
15 years 11 months ago
Slideshow: functional presentations
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
Robert Bruce Findler, Matthew Flatt
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 5 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ESWS
2009
Springer
15 years 6 months ago
An Ontology of Resources: Solving the Identity Crisis
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
Harry Halpin, Valentina Presutti
ICDAR
1999
IEEE
15 years 4 months ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha