281 search results - page 14 / 57 » Querying the Guarded Fragment |
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
QURSED enables the development of web-based query forms and reports (QFRs) that query and report semistructured XML data, i.e., data that are characterized by nesting, irregularit...
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
We extend the knowledge compilation map introduced by Darwiche and Marquis with new propositional fragments obtained by applying closure principles to several fragments studied so...
188
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...