6 search results - page 1 / 2 » Expressiveness of Efficient Semi-Deterministic Choice Constr... |
ICALP
1994
Springer
13 years 9 months ago
1994
Springer
DEDUCTIVE
1994
13 years 6 months ago
1994
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of lowco...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
BTW
2007
Springer
13 years 9 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...