Sciweavers

11862 search results - page 414 / 2373
» Relative information completeness
Sort
View
176
Voted
ENTCS
2007
101views more  ENTCS 2007»
15 years 7 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...
198
Voted
ACTA
1998
111views more  ACTA 1998»
15 years 7 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
237
Voted
TCS
1998
15 years 7 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
FSS
2010
119views more  FSS 2010»
15 years 6 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna
AAAI
2007
15 years 9 months ago
Analyzing Reading Behavior by Blog Mining
This paper presents a study of the various aspects of blog reading behavior. The analyzed data are obtained from a Japanese weblog hosting service, Doblog. Four kinds of social ne...
Tadanobu Furukawa, Mitsuru Ishizuka, Yutaka Matsuo...