Sciweavers

24 search results - page 4 / 5
» On Closure Operator for Interval Order Structures
Sort
View
CSR
2007
Springer
13 years 11 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
IJUFKS
2000
65views more  IJUFKS 2000»
13 years 5 months ago
Some Group Theoretic Aspects of t-Norms
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
Fred Richman, Elbert A. Walker
EACL
2006
ACL Anthology
13 years 7 months ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville
LFP
1992
140views more  LFP 1992»
13 years 6 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
VLDB
2004
ACM
93views Database» more  VLDB 2004»
13 years 11 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich