Sciweavers

1549 search results - page 75 / 310
» On the rules of intermediate logics
Sort
View
DKE
2008
114views more  DKE 2008»
13 years 9 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...
IDEAL
2004
Springer
14 years 2 months ago
PRICES: An Efficient Algorithm for Mining Association Rules
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
Chuan Wang, Christos Tjortjis
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
SEFM
2009
IEEE
14 years 3 months ago
Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Less
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
Patrice Chalin
RSCTC
2004
Springer
110views Fuzzy Logic» more  RSCTC 2004»
14 years 2 months ago
A Graded Applicability of Rules
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
Anna Gomolinska