Sciweavers

69 search results - page 13 / 14
» Normal Form Results for Default Logic
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 6 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
JACM
2000
81views more  JACM 2000»
13 years 6 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
14 years 29 days ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
DOLAP
2008
ACM
13 years 8 months ago
Solving summarizability problems in fact-dimension relationships for multidimensional models
Multidimensional analysis allows decision makers to efficiently and effectively use data analysis tools, which mainly depend on multidimensional (MD) structures of a data warehous...
Jose-Norberto Mazón, Jens Lechtenbörge...
HASKELL
2006
ACM
14 years 3 days ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser