Sciweavers

1000 search results - page 63 / 200
» Nominal rewriting systems
Sort
View
WADT
1998
Springer
13 years 12 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
ENTCS
2007
151views more  ENTCS 2007»
13 years 7 months ago
Coalgebraic Modal Logic Beyond Sets
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logi...
Bartek Klin
ANLP
1992
137views more  ANLP 1992»
13 years 8 months ago
Compound Nouns in a Unification-Based MT System
This paper describes an approach to the treatment of nominal compounds in a machine translation project employing a modern unification-based system. General problems connected wit...
Pierrette Bouillon, Katharina Boesefeldt, Graham R...
IAT
2009
IEEE
14 years 2 months ago
Rewriting Agent Societies Strategically
In a normative multi-agent system the behaviour of the constituting agents is regulated by means of social and organisational inspired concepts like norms and sanctions. This pape...
Lacramioara Astefanoaei, Frank S. de Boer, Mehdi D...
IWPC
2003
IEEE
14 years 28 days ago
How Understanding and Restructuring Differ from Compiling - A Rewriting Perspective
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
Paul Klint