Sciweavers

1000 search results - page 16 / 200
» Nominal rewriting systems
Sort
View
CTRS
1992
13 years 11 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
Gregory Kucherov, Mohamed Tajine
MCMASTER
1993
13 years 11 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
AUTOMATICA
2007
61views more  AUTOMATICA 2007»
13 years 7 months ago
On delay-derivative-dependent stability of systems with fast-varying delays
Stability of linear systems with uncertain bounded time-varying delays is studied under the assumption that the nominal delay values are not equal to zero. An input-output approac...
Eugenii Shustin, Emilia Fridman
FROCOS
2009
Springer
14 years 2 months ago
Automating Theories in Intuitionistic Logic
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
Guillaume Burel
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur