882 search results - page 87 / 177 » A Taste of Rewrite Systems |
117
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
107
Voted
ENTCS
2008
15 years 21 days ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
96
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
100
Voted
BIRTHDAY
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
79
Voted
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...