Sciweavers

11160 search results - page 53 / 2232
» Incompleteness in a General Setting
Sort
View
JAL
1998
85views more  JAL 1998»
13 years 9 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
LPNMR
2007
Springer
14 years 4 months ago
Semantics for Possibilistic Disjunctive Programs
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 10 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
14 years 2 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
DAC
2004
ACM
14 years 10 months ago
Sparse transformations and preconditioners for hierarchical 3-D capacitance extraction with multiple dielectrics
Capacitance extraction is an important problem that has been extensively studied. This paper presents a significant improvement for the fast multipole accelerated boundary element...
Shu Yan, Vivek Sarin, Weiping Shi