Sciweavers

1404 search results - page 57 / 281
» Complexity of admissible rules
Sort
View
134
Voted
RULEML
2005
Springer
15 years 9 months ago
A Visual Environment for Developing Defeasible Rule Bases for the Semantic Web
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
Nick Bassiliades, Efstratios Kontopoulos, Grigoris...
127
Voted
IEEEARES
2008
IEEE
15 years 10 months ago
Fast Algorithms for Consistency-Based Diagnosis of Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACL management suffer some problems that need to be addressed in order to...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael Marti...
146
Voted
EPIA
2003
Springer
15 years 9 months ago
An Evolvable Rule-Based E-mail Agent
The Semantic Web is a “living organism”, which combines autonomously evolving data sources/knowledge repositories. This dynamic character of the Semantic Web requires (declarat...
José Júlio Alferes, Antonio Brogi, J...
150
Voted
EGICE
2006
15 years 7 months ago
Evolutionary Generation of Implicative Fuzzy Rules for Design Knowledge Representation
Abstract. In knowledge representation by fuzzy rule based systems two reasoning mechanisms can be distinguished: conjunction-based and implication-based inference. Both approaches ...
Mark Freischlad, Martina Schnellenbach-Held, Torbe...
124
Voted
ATAL
2008
Springer
15 years 5 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...