1679 search results - page 29 / 336 » Strong order equivalence |
DCC
2003
IEEE
14 years 9 months ago
2003
IEEE
By Andr`e theory, it is well known how to algebraically convert a spread in a projective space to an equivalent spread (representing the same translation plane) in a projective sp...
ENTCS
2007
13 years 9 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
ER
2007
Springer
14 years 4 months ago
2007
Springer
Today, there are several approaches supporting an integrated processing of XML and (object-)relational data sources. However, each of these approaches favors a single data model f...
JUCS
2006
13 years 9 months ago
2006
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
WFLP
2009
Springer
14 years 4 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...