Sciweavers

1528 search results - page 73 / 306
» Implementing Generalized Operator Overloading
Sort
View
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 6 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
ODBIS
2007
Springer
127views Database» more  ODBIS 2007»
15 years 10 months ago
On RDF/S Ontology Evolution
Abstract. The algorithms dealing with the incorporation of new knowledge in an ontology (ontology evolution) often share a rather standard process of dealing with changes. This pro...
George Konstantinidis, Giorgos Flouris, Grigoris A...
LPNMR
2004
Springer
15 years 10 months ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
15 years 8 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
TSE
2010
110views more  TSE 2010»
15 years 3 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...