Sciweavers

472 search results - page 38 / 95
» Limiting Negations in Formulas
Sort
View
JAR
2006
94views more  JAR 2006»
13 years 10 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ILP
2003
Springer
14 years 3 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
NMR
2004
Springer
14 years 3 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
KDD
2002
ACM
128views Data Mining» more  KDD 2002»
14 years 10 months ago
Privacy preserving mining of association rules
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
Alexandre V. Evfimievski, Ramakrishnan Srikant, Ra...
CDC
2008
IEEE
14 years 4 months ago
Noise suppression in auto-regulatory gene networks
— Living cells are characterized by small populations of key molecular components that have large stochastic noise associated with them. Various gene network motifs exists within...
Abhyudai Singh, João Pedro Hespanha