Sciweavers

3134 search results - page 217 / 627
» Computing full disjunctions
Sort
View
COLING
2000
15 years 5 months ago
Automatic Extraction of Semantic Relations from Specialized Corpora
In this paper we address the problem of discovering word semantic similarities via statistical processing of text corpora. We propose a knowledge-poor method that exploits the sen...
Aristomenis Thanopoulos, Nikos Fakotakis, George K...
AAAI
1994
15 years 5 months ago
A Description Classifier for the Predicate Calculus
A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, des...
Robert M. MacGregor
AMAI
2008
Springer
15 years 4 months ago
Integrating answer set programming and constraint logic programming
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang
CGF
2008
89views more  CGF 2008»
15 years 4 months ago
Enhancement of Bright Video Features for HDR Displays
To utilize the full potential of new high dynamic range (HDR) displays, a system for the enhancement of bright luminous objects in video sequences is proposed. The system classifi...
Piotr Didyk, Rafal Mantiuk, Matthias Hein, Hans-Pe...
ENTCS
2008
72views more  ENTCS 2008»
15 years 4 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...