Sciweavers

329 search results - page 32 / 66
» SLX: the X is for extensibility
Sort
View
LREC
2008
130views Education» more  LREC 2008»
13 years 9 months ago
Boosting Precision and Recall of Hyponymy Relation Acquisition from Hierarchical Layouts in Wikipedia
This paper proposes an extension of Sumida and Torisawa's method of acquiring hyponymy relations from hierachical layouts in Wikipedia (Sumida and Torisawa, 2008). We extract...
Asuka Sumida, Naoki Yoshinaga, Kentaro Torisawa
AAAI
2004
13 years 9 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski
ECAI
2010
Springer
13 years 8 months ago
Higher-Order Coalition Logic
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
Guido Boella, Dov M. Gabbay, Valerio Genovese, Lee...
FUIN
2007
85views more  FUIN 2007»
13 years 7 months ago
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...
Daniela Bianucci, Gianpiero Cattaneo, Davide Ciucc...
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon