5130 search results - page 22 / 1026 » Constraint Query Languages |
AGP
1995
IEEE
14 years 1 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
FORMATS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
DEBS
2011
ACM
13 years 1 months ago
2011
ACM
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
SIGMOD
2008
ACM
13 years 9 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
AAAI
2007
14 years 3 days ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...