56 search results - page 8 / 12 » On the Satisfiability of Two-Variable Logic over Data Words |
STACS
2007
Springer
14 years 24 days ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
DKE
2007
13 years 6 months ago
2007
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
JODL
2000
13 years 6 months ago
2000
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
ICALT
2008
IEEE
14 years 1 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...