Sciweavers

11740 search results - page 85 / 2348
» More Problems in Rewriting
Sort
View
99
Voted
LICS
2005
IEEE
15 years 6 months ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
73
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann
FLOPS
2004
Springer
15 years 6 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
118
Voted
RTA
2004
Springer
15 years 6 months ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
107
Voted
IEEEICCI
2003
IEEE
15 years 6 months ago
Mixing Semantic Networks and Conceptual Vectors: The Case of Hyperonymy
In this paper, we focus on lexical semantics, a key issue in Natural Language Processing (NLP) that tends to converge with conceptual Knowledge Representation (KR) and ontologies....
Violaine Prince, Mathieu Lafourcade