Sciweavers

2517 search results - page 6 / 504
» Specifying Weak Sets
Sort
View
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 7 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
FTRTFT
1994
Springer
13 years 11 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 7 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
IJCAI
2007
13 years 8 months ago
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
Alan M. Frisch, Matthew Grum, Christopher Jefferso...
NOMS
2008
IEEE
131views Communications» more  NOMS 2008»
14 years 1 months ago
Availability "weak point" analysis over an SOA deployment framework
— Availability is one of the important factors to be considered for business-driven IT service management. This paper addresses the issue of analyzing what we call availability w...
Lei Xie, Jing Luo, Jie Qiu, John A. Pershing, Ying...