Sciweavers

1147 search results - page 17 / 230
» Termination in language-based systems
Sort
View
CORR
2007
Springer
80views Education» more  CORR 2007»
13 years 7 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
MVA
2000
111views Computer Vision» more  MVA 2000»
13 years 8 months ago
A Face Recognition Terminal with Effective Illumination for Access Control Systems
In this paper, a high-performance face recognition terminal for access control systems is described. The terminal is specially designed to acquire stable face patterns for reliabl...
Toshio Sato, Hiroshi Sukegawa, Kentaro Yokoi, Akio...
CADE
2001
Springer
14 years 7 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
AAAI
1994
13 years 8 months ago
Termination Analysis of OPS5 Expert Systems
Bounded response time is an important requirement when rule-based expert systems are used in real-time applications. In the case the rule-based system cannot terminate in bounded ...
Hsiu-yen Tsai, Albert Mo Kim Cheng
IROS
2008
IEEE
94views Robotics» more  IROS 2008»
14 years 1 months ago
Reactive robot control with hybrid operational models in a seaport container terminal considering system reliability
— When robot maintenance impedes the operation of other robots in a seaport container terminal, the operational efficiency is reduced. Therefore, robot reliability is necessary....
Satoshi Hoshino, Jun Ota