Sciweavers

882 search results - page 12 / 177
» A Taste of Rewrite Systems
Sort
View
ICALP
2009
Springer
14 years 7 months ago
On Constructor Rewrite Systems and the Lambda-Calculus
Ugo Dal Lago, Simone Martini
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
IJFCS
2011
78views more  IJFCS 2011»
13 years 2 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
LATA
2009
Springer
14 years 2 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
ICRA
2002
IEEE
148views Robotics» more  ICRA 2002»
14 years 12 days ago
A Neural Approach to Adaptive Behavior and Multi-Sensor Action Selection in a Mobile Device
Sampling multisensory information and taking the appropriate motor action is critical for a biological organism’s survival, but a difficult task for robots. We present a Neurally...
Jeffrey L. Krichmar, James A. Snook