We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
At present, the search for specific information on the World Wide Web is faced with several problems, which arise on the one hand from the vast number of information sources avail...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...