Sciweavers

710 search results - page 24 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
COLING
1994
13 years 9 months ago
Parsing A Flexible Word Order Language
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their ...
Vladimir Pericliev, Alexander Grigorov
ALT
2005
Springer
14 years 4 months ago
Gold-Style and Query Learning Under Various Constraints on the Target Class
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...
Sanjay Jain, Steffen Lange, Sandra Zilles
AAAI
1994
13 years 9 months ago
Temporal Reasoning with Constraints on Fluents and Events
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Eddie Schwalb, Kalev Kask, Rina Dechter
VLDB
2007
ACM
143views Database» more  VLDB 2007»
14 years 8 months ago
OLAP over Imprecise Data with Domain Constraints
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
AGP
1999
IEEE
14 years 29 min ago
Comparing expressiveness of set constructor symbols
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
Agostino Dovier, Carla Piazza, Alberto Policriti