1321 search results - page 202 / 265 » Subtyping in Logical Form |
167
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
156
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
148
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we propose a novel client-side, multi-granularity caching scheme, called "Complementary Space Caching" (CS caching), for location-based services in mobile ...
167
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...