Sciweavers

710 search results - page 38 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
MODELS
2007
Springer
15 years 7 months ago
A Metamodel-Based Approach for Analyzing Security-Design Models
Abstract We have previously proposed an expressive UML-based language for constructing and transforming security-design models, which are models that combine design specifications...
David A. Basin, Manuel Clavel, Jürgen Doser, ...
ICALP
2000
Springer
15 years 5 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
CSLP
2004
Springer
15 years 6 months ago
Property Grammars: A Fully Constraint-Based Theory
Abstract. This paper presents the basis of Property Grammars, a fully constraintbased theory. In this approach, all kinds of linguistic information is represented by means of const...
Philippe Blache
AAAI
1992
15 years 2 months ago
Lexical Imprecision in Fuzzy Constraint Networks
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
James Bowen, K. Robert Lai, Dennis Bahler
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
15 years 5 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz