Sciweavers

382 search results - page 66 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
ICDE
2006
IEEE
204views Database» more  ICDE 2006»
14 years 9 months ago
Working Models for Uncertain Data
This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but the...
Anish Das Sarma, Omar Benjelloun, Alon Y. Halevy, ...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 8 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
MCETECH
2009
Springer
14 years 2 months ago
A Non-technical User-Oriented Display Notation for XACML Conditions
Access control rules are currently administered by highly qualified personnel. Thus, the technical barrier that specialized access control languages represent naturally prevents th...
Bernard Stepien, Amy P. Felty, Stan Matwin
ICIW
2008
IEEE
14 years 2 months ago
DBOWL: Towards a Scalable and Persistent OWL Reasoner
—With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems....
María del Mar Roldán García, ...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 3 days ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe