Sciweavers

FUIN
2000
68views more  FUIN 2000»
13 years 4 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
FUIN
2000
85views more  FUIN 2000»
13 years 4 months ago
Stubborn Sets for Model Checking the EF/AG Fragment of CTL
The general stubborn set approach to CTL model checking 2] has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled tra...
Karsten Schmidt 0004
FUIN
2000
100views more  FUIN 2000»
13 years 4 months ago
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed...
Jos B. T. M. Roerdink, Arnold Meijster
FUIN
2000
109views more  FUIN 2000»
13 years 4 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman
FUIN
2000
115views more  FUIN 2000»
13 years 4 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
FUIN
2000
71views more  FUIN 2000»
13 years 4 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
FUIN
2000
76views more  FUIN 2000»
13 years 4 months ago
A Foundation for Refining Concurrent Objects
We study the notion of class refinement in a concurrent object-oriented setting. Our model is based on a combination of action systems and classes. An action system describes the b...
Martin Büchi, Emil Sekerinski
FUIN
2000
123views more  FUIN 2000»
13 years 4 months ago
Deriving and Retrieving Contextual Categorical Information through Instance Inheritance
In semantic and object-oriented data models, each class has one or more typing properties that associate it to other classes, and carry type information about all instances of the ...
Anastasia Analyti, Nicolas Spyratos, Panos Constan...