921 search results - page 94 / 185 » Expressing Computational Complexity in Constructive Type The... |
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
ERSHOV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
CNL
2009
13 years 9 months ago
2009
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
CG
2007
Springer
13 years 8 months ago
2007
Springer
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and mu...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...