4074 search results - page 363 / 815 » Abstract Graph Transformation |
174
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
158
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
165
click to vote
ROOM
2000
15 years 8 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
168
click to vote
APAL
2008
15 years 6 months ago
2008
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
167
click to vote
IANDC
2000
15 years 6 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...