Sciweavers

762 search results - page 98 / 153
» Intercode Regular Languages
Sort
View
IJCNLP
2005
Springer
15 years 8 months ago
Exploiting Lexical Conceptual Structure for Paraphrase Generation
Abstract. Lexical Conceptual Structure (LCS) represents verbs as semantic structures with a limited number of semantic predicates. This paper attempts to exploit how LCS can be use...
Atsushi Fujita, Kentaro Inui, Yuji Matsumoto
IFIP
2004
Springer
15 years 7 months ago
Formal Analysis of a Fair Payment Protocol
We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
Jan Cederquist, Muhammad Torabi Dashti
99
Voted
ICDCSW
2002
IEEE
15 years 7 months ago
Separating Introspection and Intercession to Support Metamorphic Distributed Systems
Many middleware platforms use computational reflection to support adaptive functionality. Most approaches intertwine the activity of observing behavior (introspection) with the a...
Eric P. Kasten, Philip K. McKinley, Seyed Masoud S...
125
Voted
PLILP
1997
Springer
15 years 6 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
95
Voted
LATIN
1992
Springer
15 years 6 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin