71 search results - page 6 / 15 » An Abstract Way to Define Rewriting Logic |
CSR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series wi...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
AISC
2008
Springer
13 years 9 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...
DEXAW
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper presents a first step towards a security model that defines access control for logical document structures. el benefits from roles to abstract from users and from secur...
IANDC
2006
13 years 7 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...