Sciweavers

1404 search results - page 128 / 281
» Complexity of admissible rules
Sort
View
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
14 years 15 days ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
VLDB
1987
ACM
104views Database» more  VLDB 1987»
14 years 13 days ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
ISTA
2004
13 years 10 months ago
Applying Web Service Compositions in Systems Management
: Systems management in any organization depends exclusively on the efforts of a system administrator. Every change in the IT infrastructure landscape requires changes in the syste...
Dimka Karastoyanova
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 9 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
JIKM
2008
98views more  JIKM 2008»
13 years 9 months ago
Knowledge-Based Expert System Development and Validation with Petri Nets
Expert systems (ESs) are complex information systems that are expensive to build and difficult to validate. Numerous knowledge representation strategies such as rules, semantic net...
Madjid Tavana