Sciweavers

1404 search results - page 16 / 281
» Complexity of admissible rules
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
IWANN
2009
Springer
14 years 5 months ago
Data Mining in Complex Diseases Using Evolutionary Computation
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
Vanessa Aguiar, Jose A. Seoane, Ana Freire, Cristi...
LISA
2007
14 years 21 days ago
Inferring Higher Level Policies from Firewall Rules
Packet filtering firewall is one of the most important mechanisms used by corporations to enforce their security policy. Recent years have seen a lot of research in the area of ...
Alok Tongaonkar, Niranjan Inamdar, R. Sekar
APAL
2006
107views more  APAL 2006»
13 years 10 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek
RULEML
2009
Springer
14 years 4 months ago
Exploration of SWRL Rule Bases through Visualization, Paraphrasing, and Categorization of Rules
Rule bases are increasingly being used as repositories of knowledge content on the Semantic Web. As the size and complexity of these rule bases s, developers and end users need met...
Saeed Hassanpour, Martin J. O'Connor, Amar K. Das