2152 search results - page 173 / 431 » On Automating the Calculus of Relations |
161
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
151
click to vote
DLOG
2010
15 years 4 months ago
2010
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
217
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
146
click to vote
LOPSTR
1998
Springer
15 years 10 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
201
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...