Sciweavers

2131 search results - page 96 / 427
» Immunity for Closed Sets
Sort
View
LPNMR
1993
Springer
15 years 10 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 10 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 10 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
DIAGRAMS
2006
Springer
15 years 10 months ago
The Mathematics of Boundaries: A Beginning
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
William Bricken
DAGSTUHL
2006
15 years 7 months ago
Closure and Causality
We present a model of causality which is defined by the intersection of two distinct closure systems, I and T . To present empirical evidence to demonstrate that this model has pra...
John L. Pfaltz