136 search results - page 4 / 28 » Boolean Formulas and Frequent Sets |
93
Voted
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
TCS
2010
14 years 7 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
TCC
2005
Springer
15 years 2 months ago
2005
Springer
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
KDD
2006
ACM
15 years 9 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
99
Voted
JELIA
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...