๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fault detection algorithm for logic programs

โœ Scribed by A.R. Hamdan; C.J. Hinde


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
635 KB
Volume
2
Category
Article
ISSN
0950-7051

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Floydโ€“Warshall algorithm for logi
โœ Christos Papadimitriou; Martha Sideri ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB

We explore the possibility of evaluating single-rule Datalog programs eciently and with logarithmic work space by a natural extension of the FloydยฑWarshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated ยฑ they are rather modest gener

Subspace-based fault detection algorithm
โœ Michรจle Basseville; Maher Abdelghani; Albert Benveniste ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

We address the problem of detecting faults modeled as changes in the eigenstructure of a linear dynamical system. This problem is of primary interest for structural vibration monitoring. The purpose of the paper is to describe and analyze new fault detection algorithms, based on recent stochastic su

Fault tolerance for data parallel progra
โœ C. Bertolli; M. Vanneschi ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 837 KB

## Abstract The main issues when supporting fault tolerance based on checkpointing and rollback recovery for Highโ€Performance applications are related to the scalability of the introduced support, the possibility of analyzing the induced overhead and, in more general terms, the optimization of the