Results 1  10
of
4,659
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
modification to the update rules in that we normalized both ..\ and 1r messages at each iteration. As Pearl Nodes were updated in parallel: at each iteration all nodes calculated their outgoing messages based on the incoming messages of their neighbors from the pre vious iteration. The messages were said
DISJUNCTION
"... In this paper I propose a more general framework for tableauxlike first order classical deductions in which bottomup inferences find a natural place. The result is a new system of proof for classical first order logic with many interesting normal form properties. Restricting myself to classical pr ..."
Abstract
 Add to MetaCart
In this paper I propose a more general framework for tableauxlike first order classical deductions in which bottomup inferences find a natural place. The result is a new system of proof for classical first order logic with many interesting normal form properties. Restricting myself to classical
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 427 (0 self)
 Add to MetaCart
kDL properly includes other wellknown techniques for representing Boolean functions such as kCNF (formulae in conjunctive normal form with at most k literals per clause), kDNF (formulae in disjunctive normal form with at most k literals per term), and decision trees of depth k, our result
Exponential blowup from conjunctive to disjunctive normal form
, 2002
"... Printable version of a sample proof that uses Lamport’s proof style [1], illustrating how structured proofs can be converted to HTML pages via LATEX2HTML enriched with extensions for Lamport’s proof style. Note that we try on purpose to carry out Lamport’s rule of thumb to “expand the proof until th ..."
Abstract
 Add to MetaCart
the lowest level statements are obvious, and then continue for one more level ” in order to illustrate the principles of structured proofs. Problem (cf. [2]): What is the disjunctive normal form of (x1∨y1)∧(x2 ∨ y2) ∧... ∧ (xn ∨ yn)? 1 Solution 1 (x1 ∨ y1) ∧ (x2 ∨ y2) ∧... ∧ (xn ∨ yn) ≡ (x1 ∧ x2
Backtracking Algorithms for Disjunctions of Temporal Constraints
 Artificial Intelligence
, 1998
"... We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 \Gamma y1 r1 : : : xn \Gamma yn rn , where x1 : : : xn ; y1 : : : yn are variables ranging over the real numbers, r1 : : : rn are real constants, and n 1. W ..."
Abstract

Cited by 118 (2 self)
 Add to MetaCart
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 \Gamma y1 r1 : : : xn \Gamma yn rn , where x1 : : : xn ; y1 : : : yn are variables ranging over the real numbers, r1 : : : rn are real constants, and n 1
Disjunction Category Labels
"... for enforcinginformation flowinthepresenceofmutuallydistrusting parties. DC labels can be ordered to form a lattice, based on propositional logic implication and conjunctive normal form. We introduce and prove soundness of decentralized privileges that are used in declassifying data, in addition to ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
for enforcinginformation flowinthepresenceofmutuallydistrusting parties. DC labels can be ordered to form a lattice, based on propositional logic implication and conjunctive normal form. We introduce and prove soundness of decentralized privileges that are used in declassifying data, in addition
Disjunctive Normal Forms and Local Exceptions
, 2003
"... All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a speci ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a
Outerjoins as Disjunctions
"... The outerjoin operator is currently available in the query language of several major DBMSs, and it is included in the proposed SQL2 standard draft. However, "associativity problems" of the operator have been pointed out since its introduction. In this paper we propose a shift in the int ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
join. An advantage of this view is that, in contrast to preservation, disjunction is commutative and associative, which is a significant property for intuition, formalisms, and generation of execution plans. Based on a disjunctive normal form, we show that some data merging queries cannot
Decomposable negation normal form
 JOURNAL OF THE ACM
, 2001
"... Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability of general propositional reasoning. According to this approach, the reasoning process is split into two phases: an offline compilation phase and an online queryanswer ..."
Abstract

Cited by 128 (17 self)
 Add to MetaCart
propose in this paper a new target compilation language, known as decomposable negation normal form (DNNF), and present a number of its properties that make it of interest to the broad community. Specifically, we
Rulebased Machine Learning Methods for Functional Prediction
 Journal of Artificial Intelligence Research
, 1995
"... We describe a machine learning method for predicting the value of a realvalued function, given the values of multiple input variables. The method induces solutions from samples in the form of ordered disjunctive normal form (DNF) decision rules. A central objective of the method and representation ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
We describe a machine learning method for predicting the value of a realvalued function, given the values of multiple input variables. The method induces solutions from samples in the form of ordered disjunctive normal form (DNF) decision rules. A central objective of the method and representation
Results 1  10
of
4,659